./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.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 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:35:39,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:35:39,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:35:39,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:35:39,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:35:39,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:35:39,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:35:39,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:35:39,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:35:39,685 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:35:39,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:35:39,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:35:39,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:35:39,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:35:39,685 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:35:39,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:35:39,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:35:39,685 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:35:39,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:35:39,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:35:39,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:35:39,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:35:39,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:35:39,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:35:39,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:35:39,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:35:39,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:35:39,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:35:39,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:35:39,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:35:39,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:35:39,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:35:39,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:35:39,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:35:39,688 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 -> 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 [2025-02-06 00:35:39,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:35:39,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:35:39,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:35:39,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:35:39,911 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:35:39,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2025-02-06 00:35:41,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d17af20aa/214c4c536bd646da976e9fb6616f0d65/FLAGd969b5cb5 [2025-02-06 00:35:41,341 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:35:41,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2025-02-06 00:35:41,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d17af20aa/214c4c536bd646da976e9fb6616f0d65/FLAGd969b5cb5 [2025-02-06 00:35:41,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d17af20aa/214c4c536bd646da976e9fb6616f0d65 [2025-02-06 00:35:41,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:35:41,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:35:41,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:35:41,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:35:41,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:35:41,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41, skipping insertion in model container [2025-02-06 00:35:41,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:35:41,789 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i[916,929] [2025-02-06 00:35:41,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:35:41,844 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:35:41,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i[916,929] [2025-02-06 00:35:41,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:35:41,900 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:35:41,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41 WrapperNode [2025-02-06 00:35:41,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:35:41,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:35:41,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:35:41,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:35:41,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,936 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2025-02-06 00:35:41,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:35:41,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:35:41,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:35:41,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:35:41,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,966 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 00:35:41,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:35:41,982 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:35:41,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:35:41,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:35:41,983 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (1/1) ... [2025-02-06 00:35:41,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:35:41,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:35:42,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:35:42,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:35:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:35:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:35:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:35:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:35:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:35:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:35:42,091 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:35:42,093 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:35:42,354 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2025-02-06 00:35:42,381 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-06 00:35:42,381 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:35:42,402 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:35:42,402 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:35:42,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:42 BoogieIcfgContainer [2025-02-06 00:35:42,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:35:42,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:35:42,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:35:42,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:35:42,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:35:41" (1/3) ... [2025-02-06 00:35:42,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240349e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:42, skipping insertion in model container [2025-02-06 00:35:42,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:41" (2/3) ... [2025-02-06 00:35:42,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240349e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:42, skipping insertion in model container [2025-02-06 00:35:42,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:42" (3/3) ... [2025-02-06 00:35:42,410 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-43.i [2025-02-06 00:35:42,421 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:35:42,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-43.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:35:42,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:35:42,484 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;@7535fe9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:35:42,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:35:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:35:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 00:35:42,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:42,495 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:42,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:42,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:42,499 INFO L85 PathProgramCache]: Analyzing trace with hash -835316349, now seen corresponding path program 1 times [2025-02-06 00:35:42,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:42,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854259278] [2025-02-06 00:35:42,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:42,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 00:35:42,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 00:35:42,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:42,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-06 00:35:42,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:42,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854259278] [2025-02-06 00:35:42,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854259278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:35:42,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374555872] [2025-02-06 00:35:42,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:42,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:35:42,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:35:42,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:35:42,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 00:35:42,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 00:35:42,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 00:35:42,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:42,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:42,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:35:42,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:35:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-06 00:35:42,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:35:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374555872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:35:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:35:42,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880076352] [2025-02-06 00:35:42,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:35:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:42,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:35:42,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:35:42,887 INFO L87 Difference]: Start difference. First operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:35:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:42,910 INFO L93 Difference]: Finished difference Result 154 states and 261 transitions. [2025-02-06 00:35:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:35:42,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2025-02-06 00:35:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:42,916 INFO L225 Difference]: With dead ends: 154 [2025-02-06 00:35:42,916 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 00:35:42,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:35:42,920 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:42,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:35:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 00:35:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 00:35:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:35:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2025-02-06 00:35:42,956 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 153 [2025-02-06 00:35:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:42,956 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2025-02-06 00:35:42,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:35:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2025-02-06 00:35:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 00:35:42,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:42,959 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:42,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 00:35:43,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 00:35:43,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:43,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1607855491, now seen corresponding path program 1 times [2025-02-06 00:35:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:43,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883777130] [2025-02-06 00:35:43,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:43,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 00:35:43,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 00:35:43,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:43,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:45,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:45,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883777130] [2025-02-06 00:35:45,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883777130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:45,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:45,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:35:45,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693593078] [2025-02-06 00:35:45,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:45,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:35:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:45,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:35:45,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:35:45,362 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:45,719 INFO L93 Difference]: Finished difference Result 193 states and 283 transitions. [2025-02-06 00:35:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 00:35:45,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2025-02-06 00:35:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:45,722 INFO L225 Difference]: With dead ends: 193 [2025-02-06 00:35:45,724 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 00:35:45,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:35:45,725 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 79 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:45,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 398 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:35:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 00:35:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 80. [2025-02-06 00:35:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:35:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2025-02-06 00:35:45,739 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 153 [2025-02-06 00:35:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:45,742 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 119 transitions. [2025-02-06 00:35:45,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions. [2025-02-06 00:35:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 00:35:45,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:45,745 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:45,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:35:45,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:45,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash -582122878, now seen corresponding path program 1 times [2025-02-06 00:35:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:45,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164028426] [2025-02-06 00:35:45,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:45,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 00:35:45,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 00:35:45,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:45,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164028426] [2025-02-06 00:35:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164028426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:46,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:46,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:35:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061487854] [2025-02-06 00:35:46,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:46,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:35:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:46,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:35:46,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:35:46,021 INFO L87 Difference]: Start difference. First operand 80 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:46,115 INFO L93 Difference]: Finished difference Result 196 states and 284 transitions. [2025-02-06 00:35:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:35:46,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2025-02-06 00:35:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:46,117 INFO L225 Difference]: With dead ends: 196 [2025-02-06 00:35:46,117 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 00:35:46,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:35:46,118 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 74 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:46,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 349 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:35:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 00:35:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2025-02-06 00:35:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:35:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2025-02-06 00:35:46,125 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 153 [2025-02-06 00:35:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:46,126 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2025-02-06 00:35:46,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2025-02-06 00:35:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 00:35:46,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:46,128 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:46,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:35:46,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:46,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2090646657, now seen corresponding path program 1 times [2025-02-06 00:35:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122729135] [2025-02-06 00:35:46,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:46,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:46,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 00:35:46,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 00:35:46,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:46,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:46,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122729135] [2025-02-06 00:35:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122729135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:46,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:46,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 00:35:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312306588] [2025-02-06 00:35:46,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:46,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 00:35:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:46,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 00:35:46,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:35:46,357 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:46,527 INFO L93 Difference]: Finished difference Result 201 states and 299 transitions. [2025-02-06 00:35:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 00:35:46,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2025-02-06 00:35:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:46,528 INFO L225 Difference]: With dead ends: 201 [2025-02-06 00:35:46,528 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 00:35:46,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:35:46,529 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 64 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:46,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 510 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:35:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 00:35:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2025-02-06 00:35:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 88 states have internal predecessors, (116), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 00:35:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2025-02-06 00:35:46,542 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 155 [2025-02-06 00:35:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:46,542 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2025-02-06 00:35:46,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2025-02-06 00:35:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 00:35:46,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:46,544 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:46,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:35:46,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:46,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1612439451, now seen corresponding path program 1 times [2025-02-06 00:35:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903990726] [2025-02-06 00:35:46,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:46,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:46,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 00:35:46,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 00:35:46,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:46,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:46,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:46,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903990726] [2025-02-06 00:35:46,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903990726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:46,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:46,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:35:46,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885001245] [2025-02-06 00:35:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:46,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:35:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:46,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:35:46,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:35:46,913 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:47,023 INFO L93 Difference]: Finished difference Result 303 states and 450 transitions. [2025-02-06 00:35:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:35:47,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-02-06 00:35:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:47,026 INFO L225 Difference]: With dead ends: 303 [2025-02-06 00:35:47,026 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 00:35:47,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:35:47,027 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 74 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:47,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 630 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:35:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 00:35:47,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2025-02-06 00:35:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 125 states have (on average 1.328) internal successors, (166), 127 states have internal predecessors, (166), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 00:35:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2025-02-06 00:35:47,044 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 156 [2025-02-06 00:35:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:47,044 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2025-02-06 00:35:47,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2025-02-06 00:35:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 00:35:47,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:47,045 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:47,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:35:47,045 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:47,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash -775251622, now seen corresponding path program 1 times [2025-02-06 00:35:47,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:47,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042235654] [2025-02-06 00:35:47,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:47,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 00:35:47,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 00:35:47,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:47,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:47,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042235654] [2025-02-06 00:35:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042235654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:35:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879977873] [2025-02-06 00:35:47,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:47,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:35:47,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:47,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:35:47,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:35:47,118 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:47,155 INFO L93 Difference]: Finished difference Result 441 states and 648 transitions. [2025-02-06 00:35:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:35:47,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-02-06 00:35:47,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:47,160 INFO L225 Difference]: With dead ends: 441 [2025-02-06 00:35:47,160 INFO L226 Difference]: Without dead ends: 265 [2025-02-06 00:35:47,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:35:47,161 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 64 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:47,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 246 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:35:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-06 00:35:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 200. [2025-02-06 00:35:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 147 states have internal predecessors, (193), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 00:35:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 293 transitions. [2025-02-06 00:35:47,192 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 293 transitions. Word has length 156 [2025-02-06 00:35:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:47,193 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 293 transitions. [2025-02-06 00:35:47,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 293 transitions. [2025-02-06 00:35:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 00:35:47,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:47,212 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:47,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:35:47,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:47,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1759656385, now seen corresponding path program 1 times [2025-02-06 00:35:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:47,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753661785] [2025-02-06 00:35:47,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:47,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 00:35:47,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 00:35:47,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:47,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:48,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:48,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753661785] [2025-02-06 00:35:48,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753661785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:48,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:48,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 00:35:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703617546] [2025-02-06 00:35:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:48,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:35:48,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:48,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:35:48,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:35:48,836 INFO L87 Difference]: Start difference. First operand 200 states and 293 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:49,537 INFO L93 Difference]: Finished difference Result 555 states and 779 transitions. [2025-02-06 00:35:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:35:49,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-02-06 00:35:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:49,541 INFO L225 Difference]: With dead ends: 555 [2025-02-06 00:35:49,541 INFO L226 Difference]: Without dead ends: 553 [2025-02-06 00:35:49,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:35:49,542 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 382 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:49,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 616 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 00:35:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-02-06 00:35:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 449. [2025-02-06 00:35:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 312 states have (on average 1.2467948717948718) internal successors, (389), 319 states have internal predecessors, (389), 122 states have call successors, (122), 14 states have call predecessors, (122), 14 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-06 00:35:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 633 transitions. [2025-02-06 00:35:49,606 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 633 transitions. Word has length 157 [2025-02-06 00:35:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:49,606 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 633 transitions. [2025-02-06 00:35:49,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 633 transitions. [2025-02-06 00:35:49,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 00:35:49,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:49,608 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:49,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:35:49,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:49,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:49,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2029752286, now seen corresponding path program 1 times [2025-02-06 00:35:49,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:49,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326800387] [2025-02-06 00:35:49,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:49,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:49,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 00:35:49,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 00:35:49,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:49,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326800387] [2025-02-06 00:35:50,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326800387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:50,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:50,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 00:35:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446524802] [2025-02-06 00:35:50,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:50,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 00:35:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:50,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 00:35:50,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:35:50,741 INFO L87 Difference]: Start difference. First operand 449 states and 633 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:51,792 INFO L93 Difference]: Finished difference Result 906 states and 1253 transitions. [2025-02-06 00:35:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 00:35:51,792 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-02-06 00:35:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:51,797 INFO L225 Difference]: With dead ends: 906 [2025-02-06 00:35:51,797 INFO L226 Difference]: Without dead ends: 904 [2025-02-06 00:35:51,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-02-06 00:35:51,798 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 277 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:51,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1240 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 00:35:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-02-06 00:35:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 524. [2025-02-06 00:35:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 387 states have (on average 1.2713178294573644) internal successors, (492), 394 states have internal predecessors, (492), 122 states have call successors, (122), 14 states have call predecessors, (122), 14 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-06 00:35:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 736 transitions. [2025-02-06 00:35:51,881 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 736 transitions. Word has length 157 [2025-02-06 00:35:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:51,881 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 736 transitions. [2025-02-06 00:35:51,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 736 transitions. [2025-02-06 00:35:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 00:35:51,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:51,882 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:51,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 00:35:51,883 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:51,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1263221826, now seen corresponding path program 1 times [2025-02-06 00:35:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:51,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314789530] [2025-02-06 00:35:51,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:51,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:51,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 00:35:51,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 00:35:51,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:51,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:52,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:52,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314789530] [2025-02-06 00:35:52,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314789530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:52,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:52,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 00:35:52,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308301129] [2025-02-06 00:35:52,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:52,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:35:52,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:52,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:35:52,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:35:52,810 INFO L87 Difference]: Start difference. First operand 524 states and 736 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:53,356 INFO L93 Difference]: Finished difference Result 617 states and 863 transitions. [2025-02-06 00:35:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:35:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-02-06 00:35:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:53,360 INFO L225 Difference]: With dead ends: 617 [2025-02-06 00:35:53,360 INFO L226 Difference]: Without dead ends: 615 [2025-02-06 00:35:53,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:35:53,360 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 228 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:53,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 736 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 00:35:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-02-06 00:35:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 485. [2025-02-06 00:35:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 348 states have (on average 1.2471264367816093) internal successors, (434), 355 states have internal predecessors, (434), 122 states have call successors, (122), 14 states have call predecessors, (122), 14 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-06 00:35:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 678 transitions. [2025-02-06 00:35:53,421 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 678 transitions. Word has length 157 [2025-02-06 00:35:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:53,422 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 678 transitions. [2025-02-06 00:35:53,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 678 transitions. [2025-02-06 00:35:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 00:35:53,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:53,423 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:53,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 00:35:53,424 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2024776734, now seen corresponding path program 1 times [2025-02-06 00:35:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:53,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256921885] [2025-02-06 00:35:53,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:53,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 00:35:53,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 00:35:53,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:53,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:54,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:54,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256921885] [2025-02-06 00:35:54,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256921885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:54,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:54,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:35:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794775735] [2025-02-06 00:35:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:35:54,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:54,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:35:54,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:35:54,010 INFO L87 Difference]: Start difference. First operand 485 states and 678 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:54,645 INFO L93 Difference]: Finished difference Result 1108 states and 1546 transitions. [2025-02-06 00:35:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:35:54,646 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-02-06 00:35:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:54,649 INFO L225 Difference]: With dead ends: 1108 [2025-02-06 00:35:54,649 INFO L226 Difference]: Without dead ends: 661 [2025-02-06 00:35:54,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-06 00:35:54,653 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 199 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:54,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1340 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 00:35:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-02-06 00:35:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 545. [2025-02-06 00:35:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 408 states have (on average 1.267156862745098) internal successors, (517), 415 states have internal predecessors, (517), 122 states have call successors, (122), 14 states have call predecessors, (122), 14 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-06 00:35:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 761 transitions. [2025-02-06 00:35:54,734 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 761 transitions. Word has length 157 [2025-02-06 00:35:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:54,737 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 761 transitions. [2025-02-06 00:35:54,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 761 transitions. [2025-02-06 00:35:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 00:35:54,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:54,740 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:54,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 00:35:54,740 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:54,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:54,740 INFO L85 PathProgramCache]: Analyzing trace with hash 468067158, now seen corresponding path program 1 times [2025-02-06 00:35:54,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:54,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725644688] [2025-02-06 00:35:54,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:54,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:54,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 00:35:54,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 00:35:54,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:54,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-06 00:35:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725644688] [2025-02-06 00:35:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725644688] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:35:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588034144] [2025-02-06 00:35:54,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:35:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:35:54,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:35:54,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:35:54,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 00:35:54,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 00:35:54,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:54,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:54,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 00:35:54,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:35:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-02-06 00:35:55,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:35:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-06 00:35:55,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588034144] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:35:55,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:35:55,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 00:35:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098478661] [2025-02-06 00:35:55,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:35:55,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 00:35:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:55,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 00:35:55,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:35:55,238 INFO L87 Difference]: Start difference. First operand 545 states and 761 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-02-06 00:35:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:55,425 INFO L93 Difference]: Finished difference Result 1028 states and 1410 transitions. [2025-02-06 00:35:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 00:35:55,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 157 [2025-02-06 00:35:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:55,429 INFO L225 Difference]: With dead ends: 1028 [2025-02-06 00:35:55,429 INFO L226 Difference]: Without dead ends: 521 [2025-02-06 00:35:55,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:35:55,432 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 58 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:55,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 171 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:35:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-06 00:35:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 517. [2025-02-06 00:35:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 372 states have (on average 1.196236559139785) internal successors, (445), 379 states have internal predecessors, (445), 122 states have call successors, (122), 22 states have call predecessors, (122), 22 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-06 00:35:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 689 transitions. [2025-02-06 00:35:55,508 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 689 transitions. Word has length 157 [2025-02-06 00:35:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:55,509 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 689 transitions. [2025-02-06 00:35:55,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-02-06 00:35:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 689 transitions. [2025-02-06 00:35:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 00:35:55,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:55,511 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:55,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 00:35:55,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:35:55,711 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:55,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1923747185, now seen corresponding path program 1 times [2025-02-06 00:35:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:55,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043213548] [2025-02-06 00:35:55,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:55,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 00:35:55,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 00:35:55,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:55,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-06 00:35:55,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:55,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043213548] [2025-02-06 00:35:55,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043213548] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:35:55,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472352130] [2025-02-06 00:35:55,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:55,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:35:55,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:35:55,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:35:55,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 00:35:55,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 00:35:55,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 00:35:55,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:55,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 00:35:55,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:35:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-02-06 00:35:56,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:35:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-06 00:35:56,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472352130] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:35:56,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:35:56,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2025-02-06 00:35:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544581055] [2025-02-06 00:35:56,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:35:56,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 00:35:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:56,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 00:35:56,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-02-06 00:35:56,302 INFO L87 Difference]: Start difference. First operand 517 states and 689 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 00:35:56,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:56,871 INFO L93 Difference]: Finished difference Result 1409 states and 1840 transitions. [2025-02-06 00:35:56,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 00:35:56,872 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 158 [2025-02-06 00:35:56,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:56,876 INFO L225 Difference]: With dead ends: 1409 [2025-02-06 00:35:56,876 INFO L226 Difference]: Without dead ends: 934 [2025-02-06 00:35:56,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-02-06 00:35:56,878 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 177 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:56,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 535 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 00:35:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-06 00:35:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 577. [2025-02-06 00:35:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 427 states have (on average 1.2107728337236534) internal successors, (517), 434 states have internal predecessors, (517), 122 states have call successors, (122), 27 states have call predecessors, (122), 27 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-06 00:35:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 761 transitions. [2025-02-06 00:35:56,954 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 761 transitions. Word has length 158 [2025-02-06 00:35:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:56,955 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 761 transitions. [2025-02-06 00:35:56,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 00:35:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 761 transitions. [2025-02-06 00:35:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 00:35:56,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:56,956 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:56,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 00:35:57,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:35:57,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:57,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash 230751093, now seen corresponding path program 1 times [2025-02-06 00:35:57,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:57,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305669956] [2025-02-06 00:35:57,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:57,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:57,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 00:35:57,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 00:35:57,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:57,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:35:57,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305669956] [2025-02-06 00:35:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305669956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:57,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:57,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:35:57,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846810036] [2025-02-06 00:35:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:57,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:35:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:57,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:35:57,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:35:57,794 INFO L87 Difference]: Start difference. First operand 577 states and 761 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:58,359 INFO L93 Difference]: Finished difference Result 670 states and 883 transitions. [2025-02-06 00:35:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 00:35:58,359 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2025-02-06 00:35:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:58,364 INFO L225 Difference]: With dead ends: 670 [2025-02-06 00:35:58,364 INFO L226 Difference]: Without dead ends: 668 [2025-02-06 00:35:58,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-02-06 00:35:58,364 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 168 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:58,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1007 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 00:35:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-06 00:35:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 663. [2025-02-06 00:35:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 495 states have (on average 1.2121212121212122) internal successors, (600), 504 states have internal predecessors, (600), 138 states have call successors, (138), 29 states have call predecessors, (138), 29 states have return successors, (138), 129 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 00:35:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 876 transitions. [2025-02-06 00:35:58,501 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 876 transitions. Word has length 159 [2025-02-06 00:35:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:58,501 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 876 transitions. [2025-02-06 00:35:58,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 876 transitions. [2025-02-06 00:35:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 00:35:58,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:58,503 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:58,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 00:35:58,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:58,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1142325127, now seen corresponding path program 1 times [2025-02-06 00:35:58,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:58,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865830498] [2025-02-06 00:35:58,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:58,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:58,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 00:35:58,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 00:35:58,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:58,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-06 00:35:58,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865830498] [2025-02-06 00:35:58,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865830498] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:35:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080062512] [2025-02-06 00:35:58,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:58,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:35:58,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:35:58,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:35:58,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 00:35:58,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 00:35:58,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 00:35:58,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:58,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:58,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 00:35:58,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:35:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 695 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 00:35:58,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:35:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-06 00:35:58,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080062512] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:35:58,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:35:58,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-02-06 00:35:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666992925] [2025-02-06 00:35:58,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:35:58,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 00:35:58,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:58,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 00:35:58,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-06 00:35:58,986 INFO L87 Difference]: Start difference. First operand 663 states and 876 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2025-02-06 00:35:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:59,303 INFO L93 Difference]: Finished difference Result 1310 states and 1713 transitions. [2025-02-06 00:35:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 00:35:59,303 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) Word has length 159 [2025-02-06 00:35:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:59,307 INFO L225 Difference]: With dead ends: 1310 [2025-02-06 00:35:59,307 INFO L226 Difference]: Without dead ends: 693 [2025-02-06 00:35:59,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2025-02-06 00:35:59,308 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 251 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:59,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 202 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:35:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-02-06 00:35:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 418. [2025-02-06 00:35:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 333 states have (on average 1.2402402402402402) internal successors, (413), 336 states have internal predecessors, (413), 66 states have call successors, (66), 18 states have call predecessors, (66), 18 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 00:35:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 545 transitions. [2025-02-06 00:35:59,382 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 545 transitions. Word has length 159 [2025-02-06 00:35:59,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:59,382 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 545 transitions. [2025-02-06 00:35:59,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2025-02-06 00:35:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 545 transitions. [2025-02-06 00:35:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 00:35:59,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:59,385 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:59,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 00:35:59,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 00:35:59,586 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:59,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash 421417631, now seen corresponding path program 1 times [2025-02-06 00:35:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:59,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526484039] [2025-02-06 00:35:59,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:59,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 00:35:59,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 00:35:59,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:59,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:35:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-06 00:35:59,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:35:59,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526484039] [2025-02-06 00:35:59,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526484039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:35:59,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:35:59,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:35:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310799235] [2025-02-06 00:35:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:35:59,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:35:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:35:59,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:35:59,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:35:59,718 INFO L87 Difference]: Start difference. First operand 418 states and 545 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:35:59,891 INFO L93 Difference]: Finished difference Result 841 states and 1094 transitions. [2025-02-06 00:35:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:35:59,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-06 00:35:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:35:59,893 INFO L225 Difference]: With dead ends: 841 [2025-02-06 00:35:59,893 INFO L226 Difference]: Without dead ends: 426 [2025-02-06 00:35:59,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:35:59,896 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 72 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:35:59,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 178 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:35:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-06 00:35:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 422. [2025-02-06 00:35:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 336 states have (on average 1.1547619047619047) internal successors, (388), 339 states have internal predecessors, (388), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 00:35:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 520 transitions. [2025-02-06 00:35:59,948 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 520 transitions. Word has length 160 [2025-02-06 00:35:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:35:59,948 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 520 transitions. [2025-02-06 00:35:59,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:35:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 520 transitions. [2025-02-06 00:35:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 00:35:59,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:35:59,949 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:35:59,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 00:35:59,950 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:35:59,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:35:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash 128014624, now seen corresponding path program 1 times [2025-02-06 00:35:59,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:35:59,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768886203] [2025-02-06 00:35:59,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:35:59,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 00:35:59,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 00:35:59,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:35:59,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 00:35:59,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532642977] [2025-02-06 00:35:59,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:35:59,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:35:59,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:35:59,987 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-06 00:35:59,990 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-06 00:36:00,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 00:36:00,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 00:36:00,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:36:00,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:36:00,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:36:00,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 00:36:00,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 00:36:00,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:36:00,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:36:00,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:36:00,144 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:36:00,144 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:36:00,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 00:36:00,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 00:36:00,349 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:36:00,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:36:00,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:36:00 BoogieIcfgContainer [2025-02-06 00:36:00,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:36:00,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:36:00,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:36:00,408 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:36:00,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:42" (3/4) ... [2025-02-06 00:36:00,410 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:36:00,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:36:00,411 INFO L158 Benchmark]: Toolchain (without parser) took 18747.20ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 133.1MB in the beginning and 295.3MB in the end (delta: -162.2MB). Peak memory consumption was 315.1MB. Max. memory is 16.1GB. [2025-02-06 00:36:00,411 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 218.1MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:36:00,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.91ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:36:00,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.85ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 117.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:36:00,412 INFO L158 Benchmark]: Boogie Preprocessor took 44.78ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:36:00,412 INFO L158 Benchmark]: IcfgBuilder took 420.56ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 93.1MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 00:36:00,412 INFO L158 Benchmark]: TraceAbstraction took 18002.74ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 92.4MB in the beginning and 295.5MB in the end (delta: -203.0MB). Peak memory consumption was 273.1MB. Max. memory is 16.1GB. [2025-02-06 00:36:00,412 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 645.9MB. Free memory was 295.5MB in the beginning and 295.3MB in the end (delta: 135.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:36:00,413 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.13ms. Allocated memory is still 218.1MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.91ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.85ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 117.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.78ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 420.56ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 93.1MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18002.74ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 92.4MB in the beginning and 295.5MB in the end (delta: -203.0MB). Peak memory consumption was 273.1MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 645.9MB. Free memory was 295.5MB in the beginning and 295.3MB in the end (delta: 135.2kB). 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 47, overapproximation of shiftLeft at line 112, overapproximation of bitwiseOr at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] signed long int var_1_2 = 4; [L24] signed long int var_1_3 = 64; [L25] signed long int var_1_4 = 64; [L26] signed long int var_1_5 = 0; [L27] signed short int var_1_7 = 10000; [L28] signed short int var_1_8 = 1; [L29] signed short int var_1_9 = 50; [L30] signed short int var_1_10 = 8; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 100; [L33] unsigned short int var_1_15 = 128; [L34] unsigned short int var_1_16 = 23647; [L35] unsigned short int var_1_17 = 32; [L36] signed char var_1_18 = 0; [L37] signed char var_1_19 = -50; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; VAL [isInitial=0, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=4, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] FCALL updateLastVariables() [L120] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L73] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L75] var_1_3 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L76] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L78] var_1_4 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L79] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L81] var_1_5 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L83] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L83] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L84] var_1_7 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L85] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L86] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L86] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L87] var_1_8 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L88] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L89] CALL assume_abort_if_not(var_1_8 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L89] RET assume_abort_if_not(var_1_8 <= 8192) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L90] var_1_9 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_9 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L92] RET assume_abort_if_not(var_1_9 <= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L93] var_1_10 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L95] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L96] var_1_14 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L97] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L98] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L99] var_1_16 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L100] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L101] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L102] var_1_19 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L103] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L104] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L106] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L107] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L120] RET updateVariables() [L121] CALL step() [L43] var_1_18 = var_1_19 [L44] var_1_20 = var_1_21 [L45] signed char stepLocal_1 = var_1_18; [L46] signed long int stepLocal_0 = var_1_9 / var_1_7; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=3, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L47] EXPR var_1_8 << var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_1=3, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L47] COND FALSE !(stepLocal_1 > (var_1_8 << var_1_10)) [L54] EXPR var_1_7 ^ var_1_18 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L54] signed long int stepLocal_2 = var_1_7 ^ var_1_18; [L55] COND TRUE var_1_14 >= stepLocal_2 [L56] var_1_15 = (var_1_14 + (var_1_16 - var_1_13)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L58] COND TRUE var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L59] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L69] var_1_17 = var_1_1 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112] EXPR var_1_8 << var_1_10 VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112] EXPR (((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112-L113] return ((((((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1)) && (var_1_17 == ((unsigned short int) var_1_1))) && (var_1_18 == ((signed char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2217 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2167 mSDsluCounter, 8270 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6330 mSDsCounter, 428 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5039 IncrementalHoareTripleChecker+Invalid, 5467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 428 mSolverCounterUnsat, 1940 mSDtfsCounter, 5039 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1274 GetRequests, 1120 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=663occurred in iteration=13, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 1527 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 3294 NumberOfCodeBlocks, 3294 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3426 ConstructedInterpolants, 0 QuantifiedInterpolants, 9708 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1391 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 23855/24288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 00:36:00,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.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 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:36:02,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:36:02,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:36:02,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:36:02,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:36:02,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:36:02,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:36:02,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:36:02,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:36:02,581 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:36:02,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:36:02,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:36:02,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:36:02,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:36:02,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:36:02,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:36:02,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:36:02,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:36:02,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:36:02,585 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 -> 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 [2025-02-06 00:36:02,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:36:02,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:36:02,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:36:02,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:36:02,833 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:36:02,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2025-02-06 00:36:04,011 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35932a522/3a5b1be66c594928a0b458cfae9568aa/FLAG921ba71e8 [2025-02-06 00:36:04,232 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:36:04,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2025-02-06 00:36:04,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35932a522/3a5b1be66c594928a0b458cfae9568aa/FLAG921ba71e8 [2025-02-06 00:36:04,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35932a522/3a5b1be66c594928a0b458cfae9568aa [2025-02-06 00:36:04,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:36:04,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:36:04,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:36:04,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:36:04,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:36:04,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71498af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04, skipping insertion in model container [2025-02-06 00:36:04,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:36:04,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i[916,929] [2025-02-06 00:36:04,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:36:04,439 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:36:04,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i[916,929] [2025-02-06 00:36:04,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:36:04,493 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:36:04,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04 WrapperNode [2025-02-06 00:36:04,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:36:04,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:36:04,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:36:04,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:36:04,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,523 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2025-02-06 00:36:04,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:36:04,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:36:04,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:36:04,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:36:04,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,550 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 00:36:04,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:36:04,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:36:04,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:36:04,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:36:04,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (1/1) ... [2025-02-06 00:36:04,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:36:04,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:36:04,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:36:04,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:36:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:36:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:36:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:36:04,615 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:36:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:36:04,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:36:04,678 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:36:04,679 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:36:04,905 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 00:36:04,907 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:36:04,918 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:36:04,919 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:36:04,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:36:04 BoogieIcfgContainer [2025-02-06 00:36:04,919 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:36:04,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:36:04,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:36:04,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:36:04,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:36:04" (1/3) ... [2025-02-06 00:36:04,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f81a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:36:04, skipping insertion in model container [2025-02-06 00:36:04,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:04" (2/3) ... [2025-02-06 00:36:04,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f81a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:36:04, skipping insertion in model container [2025-02-06 00:36:04,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:36:04" (3/3) ... [2025-02-06 00:36:04,928 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-43.i [2025-02-06 00:36:04,938 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:36:04,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-43.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:36:04,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:36:04,994 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;@1f5b151c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:36:04,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:36:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:36:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 00:36:05,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:36:05,008 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:36:05,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:36:05,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:36:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1565192675, now seen corresponding path program 1 times [2025-02-06 00:36:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:36:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179267009] [2025-02-06 00:36:05,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:36:05,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:36:05,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:36:05,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:36:05,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 00:36:05,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:36:05,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:36:05,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:36:05,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:36:05,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:36:05,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:36:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-06 00:36:05,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:36:05,272 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:36:05,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179267009] [2025-02-06 00:36:05,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179267009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:36:05,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:36:05,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:36:05,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395828269] [2025-02-06 00:36:05,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:36:05,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:36:05,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:36:05,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:36:05,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:36:05,290 INFO L87 Difference]: Start difference. First operand has 62 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:36:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:36:05,306 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2025-02-06 00:36:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:36:05,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 147 [2025-02-06 00:36:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:36:05,311 INFO L225 Difference]: With dead ends: 118 [2025-02-06 00:36:05,311 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 00:36:05,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:36:05,323 INFO L435 NwaCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:36:05,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:36:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 00:36:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 00:36:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:36:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-02-06 00:36:05,353 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 147 [2025-02-06 00:36:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:36:05,353 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-02-06 00:36:05,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:36:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-02-06 00:36:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 00:36:05,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:36:05,357 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:36:05,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 00:36:05,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:36:05,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:36:05,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:36:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash 967625187, now seen corresponding path program 1 times [2025-02-06 00:36:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:36:05,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340535049] [2025-02-06 00:36:05,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:36:05,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:36:05,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:36:05,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:36:05,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:36:05,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:36:05,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:36:05,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:36:05,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:36:05,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 00:36:05,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:36:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-06 00:36:05,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:36:05,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:36:05,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340535049] [2025-02-06 00:36:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340535049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:36:05,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:36:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:36:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311577320] [2025-02-06 00:36:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:36:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:36:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:36:05,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:36:05,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:36:05,810 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:36:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:36:06,153 INFO L93 Difference]: Finished difference Result 123 states and 180 transitions. [2025-02-06 00:36:06,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:36:06,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 147 [2025-02-06 00:36:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:36:06,155 INFO L225 Difference]: With dead ends: 123 [2025-02-06 00:36:06,156 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 00:36:06,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:36:06,157 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 81 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:36:06,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 120 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:36:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 00:36:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-02-06 00:36:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:36:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2025-02-06 00:36:06,172 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 147 [2025-02-06 00:36:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:36:06,172 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2025-02-06 00:36:06,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:36:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2025-02-06 00:36:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 00:36:06,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:36:06,177 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:36:06,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 00:36:06,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:36:06,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:36:06,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:36:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash 996254338, now seen corresponding path program 1 times [2025-02-06 00:36:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:36:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809050246] [2025-02-06 00:36:06,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:36:06,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:36:06,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:36:06,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:36:06,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 00:36:06,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:36:06,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:36:06,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:36:06,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:36:06,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 00:36:06,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:36:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 516 proven. 174 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2025-02-06 00:36:52,290 INFO L312 TraceCheckSpWp]: Computing backward predicates...