./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.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_fillercode_fillercodestructure_filler-pr-ci_file-74.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 f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:01:35,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:01:35,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:01:35,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:01:35,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:01:35,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:01:35,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:01:35,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:01:35,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:01:35,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:01:35,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:01:35,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:01:35,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:01:35,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:01:35,934 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:01:35,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:01:35,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:01:35,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:01:35,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:01:35,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:01:35,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:01:35,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:01:35,936 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 -> f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 [2025-02-05 23:01:36,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:01:36,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:01:36,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:01:36,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:01:36,170 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:01:36,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2025-02-05 23:01:37,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecb563dbd/f6a23368c263492ab73e1b197d2dda98/FLAG3178857b8 [2025-02-05 23:01:37,755 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:01:37,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2025-02-05 23:01:37,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecb563dbd/f6a23368c263492ab73e1b197d2dda98/FLAG3178857b8 [2025-02-05 23:01:37,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecb563dbd/f6a23368c263492ab73e1b197d2dda98 [2025-02-05 23:01:37,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:01:37,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:01:37,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:01:37,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:01:37,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:01:37,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:01:37" (1/1) ... [2025-02-05 23:01:37,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@beba044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:37, skipping insertion in model container [2025-02-05 23:01:37,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:01:37" (1/1) ... [2025-02-05 23:01:37,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:01:37,869 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_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2025-02-05 23:01:37,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:01:37,947 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:01:37,956 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_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2025-02-05 23:01:37,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:01:38,007 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:01:38,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38 WrapperNode [2025-02-05 23:01:38,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:01:38,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:01:38,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:01:38,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:01:38,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,049 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-02-05 23:01:38,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:01:38,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:01:38,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:01:38,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:01:38,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,079 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 23:01:38,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:01:38,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:01:38,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:01:38,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:01:38,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (1/1) ... [2025-02-05 23:01:38,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:01:38,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:01:38,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:01:38,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:01:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:01:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:01:38,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:01:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:01:38,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:01:38,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:01:38,191 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:01:38,192 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:01:38,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2025-02-05 23:01:38,534 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 23:01:38,536 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:01:38,556 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:01:38,558 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-05 23:01:38,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:01:38 BoogieIcfgContainer [2025-02-05 23:01:38,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:01:38,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:01:38,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:01:38,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:01:38,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:01:37" (1/3) ... [2025-02-05 23:01:38,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7705f24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:01:38, skipping insertion in model container [2025-02-05 23:01:38,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:38" (2/3) ... [2025-02-05 23:01:38,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7705f24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:01:38, skipping insertion in model container [2025-02-05 23:01:38,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:01:38" (3/3) ... [2025-02-05 23:01:38,567 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2025-02-05 23:01:38,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:01:38,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:01:38,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:01:38,639 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;@dc95646, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:01:38,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:01:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 23:01:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 23:01:38,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:38,657 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:38,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:38,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash -146957033, now seen corresponding path program 1 times [2025-02-05 23:01:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:38,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465928414] [2025-02-05 23:01:38,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:38,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 23:01:38,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 23:01:38,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:38,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 23:01:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:38,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465928414] [2025-02-05 23:01:38,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465928414] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:01:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594569012] [2025-02-05 23:01:38,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:38,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:01:38,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:01:38,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:01:38,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:01:39,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 23:01:39,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 23:01:39,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:39,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:39,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:01:39,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:01:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 23:01:39,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:01:39,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594569012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:39,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:01:39,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:01:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107258963] [2025-02-05 23:01:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:39,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:01:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:39,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:01:39,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:01:39,173 INFO L87 Difference]: Start difference. First operand has 98 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:39,203 INFO L93 Difference]: Finished difference Result 189 states and 319 transitions. [2025-02-05 23:01:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:01:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2025-02-05 23:01:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:39,219 INFO L225 Difference]: With dead ends: 189 [2025-02-05 23:01:39,222 INFO L226 Difference]: Without dead ends: 94 [2025-02-05 23:01:39,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:01:39,228 INFO L435 NwaCegarLoop]: 136 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, 136 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-05 23:01:39,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:01:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-05 23:01:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-05 23:01:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 23:01:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2025-02-05 23:01:39,272 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 155 [2025-02-05 23:01:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:39,273 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2025-02-05 23:01:39,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2025-02-05 23:01:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 23:01:39,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:39,277 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:39,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 23:01:39,478 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-05 23:01:39,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:39,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1430651983, now seen corresponding path program 1 times [2025-02-05 23:01:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:39,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975509510] [2025-02-05 23:01:39,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:39,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:39,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 23:01:39,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 23:01:39,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:39,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:39,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:39,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975509510] [2025-02-05 23:01:39,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975509510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:39,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:39,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:01:39,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7240037] [2025-02-05 23:01:39,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:39,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:01:39,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:39,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:01:39,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:01:39,687 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:39,746 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2025-02-05 23:01:39,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:01:39,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2025-02-05 23:01:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:39,752 INFO L225 Difference]: With dead ends: 243 [2025-02-05 23:01:39,752 INFO L226 Difference]: Without dead ends: 152 [2025-02-05 23:01:39,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:01:39,753 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 76 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:39,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 278 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:01:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-05 23:01:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2025-02-05 23:01:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 117 states have internal predecessors, (156), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 23:01:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 216 transitions. [2025-02-05 23:01:39,776 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 216 transitions. Word has length 155 [2025-02-05 23:01:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:39,779 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 216 transitions. [2025-02-05 23:01:39,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 216 transitions. [2025-02-05 23:01:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 23:01:39,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:39,783 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:39,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:01:39,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:39,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash -366299376, now seen corresponding path program 1 times [2025-02-05 23:01:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781557429] [2025-02-05 23:01:39,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:39,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:39,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 23:01:39,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 23:01:39,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:39,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:40,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781557429] [2025-02-05 23:01:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781557429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:40,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:01:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468319434] [2025-02-05 23:01:40,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:40,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:01:40,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:40,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:01:40,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:01:40,118 INFO L87 Difference]: Start difference. First operand 149 states and 216 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:40,183 INFO L93 Difference]: Finished difference Result 297 states and 433 transitions. [2025-02-05 23:01:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:01:40,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2025-02-05 23:01:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:40,189 INFO L225 Difference]: With dead ends: 297 [2025-02-05 23:01:40,189 INFO L226 Difference]: Without dead ends: 151 [2025-02-05 23:01:40,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:01:40,192 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:40,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:01:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-05 23:01:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-05 23:01:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 119 states have internal predecessors, (158), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 23:01:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2025-02-05 23:01:40,211 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 155 [2025-02-05 23:01:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:40,211 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2025-02-05 23:01:40,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2025-02-05 23:01:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 23:01:40,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:40,215 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:40,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:01:40,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:40,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 958782647, now seen corresponding path program 1 times [2025-02-05 23:01:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653234233] [2025-02-05 23:01:40,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:40,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 23:01:40,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 23:01:40,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:40,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:40,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:40,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653234233] [2025-02-05 23:01:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653234233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:01:40,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102718438] [2025-02-05 23:01:40,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:40,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:01:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:40,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:01:40,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:01:40,848 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:41,109 INFO L93 Difference]: Finished difference Result 436 states and 629 transitions. [2025-02-05 23:01:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:01:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2025-02-05 23:01:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:41,111 INFO L225 Difference]: With dead ends: 436 [2025-02-05 23:01:41,112 INFO L226 Difference]: Without dead ends: 288 [2025-02-05 23:01:41,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:01:41,115 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 120 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:41,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 433 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:01:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-05 23:01:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 198. [2025-02-05 23:01:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 142 states have internal predecessors, (181), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 23:01:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 285 transitions. [2025-02-05 23:01:41,145 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 285 transitions. Word has length 157 [2025-02-05 23:01:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:41,145 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 285 transitions. [2025-02-05 23:01:41,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 285 transitions. [2025-02-05 23:01:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 23:01:41,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:41,148 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:41,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:01:41,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:41,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1468826074, now seen corresponding path program 1 times [2025-02-05 23:01:41,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:41,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574315176] [2025-02-05 23:01:41,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:41,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:41,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 23:01:41,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 23:01:41,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:41,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:41,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:41,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574315176] [2025-02-05 23:01:41,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574315176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:41,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:01:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961005024] [2025-02-05 23:01:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:41,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:01:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:41,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:01:41,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:01:41,558 INFO L87 Difference]: Start difference. First operand 198 states and 285 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:41,841 INFO L93 Difference]: Finished difference Result 436 states and 628 transitions. [2025-02-05 23:01:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:01:41,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2025-02-05 23:01:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:41,844 INFO L225 Difference]: With dead ends: 436 [2025-02-05 23:01:41,844 INFO L226 Difference]: Without dead ends: 288 [2025-02-05 23:01:41,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:01:41,845 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 118 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:41,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 511 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:01:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-05 23:01:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 199. [2025-02-05 23:01:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 143 states have internal predecessors, (182), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 23:01:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 286 transitions. [2025-02-05 23:01:41,868 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 286 transitions. Word has length 158 [2025-02-05 23:01:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:41,868 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 286 transitions. [2025-02-05 23:01:41,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 286 transitions. [2025-02-05 23:01:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 23:01:41,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:41,870 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:41,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:01:41,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1214089529, now seen corresponding path program 1 times [2025-02-05 23:01:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360232327] [2025-02-05 23:01:41,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:41,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 23:01:41,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 23:01:41,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:41,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:42,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:42,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360232327] [2025-02-05 23:01:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360232327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:42,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:42,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 23:01:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636349515] [2025-02-05 23:01:42,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:42,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 23:01:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:42,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 23:01:42,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:01:42,369 INFO L87 Difference]: Start difference. First operand 199 states and 286 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:42,886 INFO L93 Difference]: Finished difference Result 541 states and 767 transitions. [2025-02-05 23:01:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:01:42,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2025-02-05 23:01:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:42,890 INFO L225 Difference]: With dead ends: 541 [2025-02-05 23:01:42,890 INFO L226 Difference]: Without dead ends: 393 [2025-02-05 23:01:42,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:01:42,891 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 189 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:42,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 543 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:01:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-05 23:01:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 324. [2025-02-05 23:01:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 247 states have (on average 1.2834008097165992) internal successors, (317), 250 states have internal predecessors, (317), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 23:01:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 457 transitions. [2025-02-05 23:01:42,932 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 457 transitions. Word has length 158 [2025-02-05 23:01:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:42,932 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 457 transitions. [2025-02-05 23:01:42,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 457 transitions. [2025-02-05 23:01:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 23:01:42,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:42,934 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:42,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:01:42,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:42,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash -593364934, now seen corresponding path program 1 times [2025-02-05 23:01:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:42,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515751705] [2025-02-05 23:01:42,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:42,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 23:01:43,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 23:01:43,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:43,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515751705] [2025-02-05 23:01:43,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515751705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:43,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:43,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:01:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014468488] [2025-02-05 23:01:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:43,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:01:43,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:43,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:01:43,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:01:43,526 INFO L87 Difference]: Start difference. First operand 324 states and 457 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:43,935 INFO L93 Difference]: Finished difference Result 776 states and 1089 transitions. [2025-02-05 23:01:43,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:01:43,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 158 [2025-02-05 23:01:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:43,938 INFO L225 Difference]: With dead ends: 776 [2025-02-05 23:01:43,938 INFO L226 Difference]: Without dead ends: 503 [2025-02-05 23:01:43,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:01:43,940 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 253 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:43,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 494 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:01:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-05 23:01:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 324. [2025-02-05 23:01:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 247 states have (on average 1.2672064777327936) internal successors, (313), 250 states have internal predecessors, (313), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 23:01:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 453 transitions. [2025-02-05 23:01:43,972 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 453 transitions. Word has length 158 [2025-02-05 23:01:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:43,973 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 453 transitions. [2025-02-05 23:01:43,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 453 transitions. [2025-02-05 23:01:43,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:01:43,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:43,974 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:43,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:01:43,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash 323695315, now seen corresponding path program 1 times [2025-02-05 23:01:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348147279] [2025-02-05 23:01:43,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:43,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:01:44,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:01:44,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:44,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:01:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348147279] [2025-02-05 23:01:44,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348147279] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:01:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756451156] [2025-02-05 23:01:44,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:44,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:01:44,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:01:44,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:01:44,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 23:01:44,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:01:44,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:01:44,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:44,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:44,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 23:01:44,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:01:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-02-05 23:01:44,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:01:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:01:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756451156] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:01:44,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:01:44,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 23:01:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431774785] [2025-02-05 23:01:44,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:01:44,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:01:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:44,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:01:44,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:01:44,628 INFO L87 Difference]: Start difference. First operand 324 states and 453 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-05 23:01:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:44,824 INFO L93 Difference]: Finished difference Result 590 states and 820 transitions. [2025-02-05 23:01:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:01:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 160 [2025-02-05 23:01:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:44,827 INFO L225 Difference]: With dead ends: 590 [2025-02-05 23:01:44,827 INFO L226 Difference]: Without dead ends: 317 [2025-02-05 23:01:44,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:01:44,830 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 151 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:44,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 214 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:01:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-05 23:01:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2025-02-05 23:01:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 226 states have (on average 1.2300884955752212) internal successors, (278), 229 states have internal predecessors, (278), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 23:01:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 418 transitions. [2025-02-05 23:01:44,868 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 418 transitions. Word has length 160 [2025-02-05 23:01:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:44,869 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 418 transitions. [2025-02-05 23:01:44,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-05 23:01:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 418 transitions. [2025-02-05 23:01:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:01:44,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:44,870 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:44,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 23:01:45,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:01:45,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:45,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1638960791, now seen corresponding path program 1 times [2025-02-05 23:01:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:45,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659535945] [2025-02-05 23:01:45,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:45,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:45,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:01:45,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:01:45,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:45,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659535945] [2025-02-05 23:01:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659535945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:45,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:45,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:01:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001792184] [2025-02-05 23:01:45,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:45,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:01:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:45,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:01:45,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:01:45,432 INFO L87 Difference]: Start difference. First operand 305 states and 418 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:46,199 INFO L93 Difference]: Finished difference Result 694 states and 955 transitions. [2025-02-05 23:01:46,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:01:46,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 160 [2025-02-05 23:01:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:46,202 INFO L225 Difference]: With dead ends: 694 [2025-02-05 23:01:46,202 INFO L226 Difference]: Without dead ends: 444 [2025-02-05 23:01:46,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:01:46,203 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 338 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:46,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 479 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:01:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-05 23:01:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 416. [2025-02-05 23:01:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 303 states have (on average 1.2112211221122111) internal successors, (367), 308 states have internal predecessors, (367), 100 states have call successors, (100), 12 states have call predecessors, (100), 12 states have return successors, (100), 95 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:01:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 567 transitions. [2025-02-05 23:01:46,256 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 567 transitions. Word has length 160 [2025-02-05 23:01:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:46,256 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 567 transitions. [2025-02-05 23:01:46,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 567 transitions. [2025-02-05 23:01:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 23:01:46,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:46,258 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:46,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:01:46,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:46,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash 859055146, now seen corresponding path program 1 times [2025-02-05 23:01:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:46,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535165595] [2025-02-05 23:01:46,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:46,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:46,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:01:46,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:01:46,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:01:46,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535165595] [2025-02-05 23:01:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535165595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:01:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587165451] [2025-02-05 23:01:46,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:46,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:01:46,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:01:46,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:01:46,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 23:01:46,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 23:01:46,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 23:01:46,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:46,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:46,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 23:01:46,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:01:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-02-05 23:01:46,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:01:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:01:46,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587165451] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:01:46,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:01:46,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 23:01:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960800893] [2025-02-05 23:01:46,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:01:46,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 23:01:46,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:46,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 23:01:46,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:01:46,722 INFO L87 Difference]: Start difference. First operand 416 states and 567 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-05 23:01:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:46,937 INFO L93 Difference]: Finished difference Result 678 states and 923 transitions. [2025-02-05 23:01:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:01:46,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 160 [2025-02-05 23:01:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:46,940 INFO L225 Difference]: With dead ends: 678 [2025-02-05 23:01:46,940 INFO L226 Difference]: Without dead ends: 317 [2025-02-05 23:01:46,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:01:46,941 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 143 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:46,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 273 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:01:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-05 23:01:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2025-02-05 23:01:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 226 states have (on average 1.2123893805309736) internal successors, (274), 229 states have internal predecessors, (274), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 23:01:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 414 transitions. [2025-02-05 23:01:46,967 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 414 transitions. Word has length 160 [2025-02-05 23:01:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:46,967 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 414 transitions. [2025-02-05 23:01:46,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-05 23:01:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 414 transitions. [2025-02-05 23:01:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 23:01:46,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:46,969 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:46,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 23:01:47,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:01:47,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:47,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1721955368, now seen corresponding path program 1 times [2025-02-05 23:01:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:47,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839719598] [2025-02-05 23:01:47,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:47,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 23:01:47,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 23:01:47,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:47,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:01:47,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:47,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839719598] [2025-02-05 23:01:47,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839719598] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:01:47,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352902545] [2025-02-05 23:01:47,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:47,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:01:47,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:01:47,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:01:47,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 23:01:47,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 23:01:47,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 23:01:47,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:47,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:47,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 23:01:47,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:01:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 562 proven. 54 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2025-02-05 23:01:48,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:01:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2025-02-05 23:01:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352902545] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:01:48,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:01:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 27 [2025-02-05 23:01:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344125114] [2025-02-05 23:01:48,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:01:48,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 23:01:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:48,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 23:01:48,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2025-02-05 23:01:48,717 INFO L87 Difference]: Start difference. First operand 305 states and 414 transitions. Second operand has 27 states, 26 states have (on average 5.538461538461538) internal successors, (144), 27 states have internal predecessors, (144), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2025-02-05 23:01:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:50,060 INFO L93 Difference]: Finished difference Result 867 states and 1155 transitions. [2025-02-05 23:01:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 23:01:50,061 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.538461538461538) internal successors, (144), 27 states have internal predecessors, (144), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) Word has length 164 [2025-02-05 23:01:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:50,064 INFO L225 Difference]: With dead ends: 867 [2025-02-05 23:01:50,064 INFO L226 Difference]: Without dead ends: 617 [2025-02-05 23:01:50,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=889, Invalid=2191, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 23:01:50,066 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 807 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:50,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 654 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:01:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-02-05 23:01:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 373. [2025-02-05 23:01:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 292 states have (on average 1.202054794520548) internal successors, (351), 295 states have internal predecessors, (351), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 23:01:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 491 transitions. [2025-02-05 23:01:50,099 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 491 transitions. Word has length 164 [2025-02-05 23:01:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:50,100 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 491 transitions. [2025-02-05 23:01:50,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.538461538461538) internal successors, (144), 27 states have internal predecessors, (144), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2025-02-05 23:01:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 491 transitions. [2025-02-05 23:01:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 23:01:50,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:50,102 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:50,118 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-05 23:01:50,307 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,SelfDestructingSolverStorable10 [2025-02-05 23:01:50,307 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:50,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash -74995991, now seen corresponding path program 1 times [2025-02-05 23:01:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:50,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600845876] [2025-02-05 23:01:50,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:50,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 23:01:50,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 23:01:50,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:50,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 23:01:50,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463999176] [2025-02-05 23:01:50,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:50,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:01:50,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:01:50,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:01:50,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 23:01:50,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 23:01:50,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 23:01:50,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:50,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:01:50,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 23:01:50,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 23:01:50,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 23:01:50,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:50,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:01:50,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 23:01:50,732 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 23:01:50,733 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 23:01:50,746 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-05 23:01:50,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 23:01:50,938 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:51,005 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 23:01:51,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:01:51 BoogieIcfgContainer [2025-02-05 23:01:51,010 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 23:01:51,011 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 23:01:51,011 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 23:01:51,011 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 23:01:51,011 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:01:38" (3/4) ... [2025-02-05 23:01:51,013 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 23:01:51,013 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 23:01:51,014 INFO L158 Benchmark]: Toolchain (without parser) took 13239.68ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 121.7MB in the beginning and 321.6MB in the end (delta: -199.9MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2025-02-05 23:01:51,014 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:01:51,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.25ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 106.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 23:01:51,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.98ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 102.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:01:51,014 INFO L158 Benchmark]: Boogie Preprocessor took 39.08ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 97.1MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 23:01:51,014 INFO L158 Benchmark]: IcfgBuilder took 468.95ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 67.1MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 23:01:51,015 INFO L158 Benchmark]: TraceAbstraction took 12449.79ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 67.1MB in the beginning and 321.8MB in the end (delta: -254.7MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-02-05 23:01:51,015 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 436.2MB. Free memory was 321.8MB in the beginning and 321.6MB in the end (delta: 138.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 23:01:51,016 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.20ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.25ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 106.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.98ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 102.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.08ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 97.1MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 468.95ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 67.1MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12449.79ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 67.1MB in the beginning and 321.8MB in the end (delta: -254.7MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 436.2MB. Free memory was 321.8MB in the beginning and 321.6MB in the end (delta: 138.5kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 171, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryFLOATComparisonOperation at line 163, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of bitwiseOr at line 98, overapproximation of bitwiseOr at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] float var_1_28 = 3.5; [L44] signed short int var_1_29 = -8; [L45] signed char var_1_31 = -32; [L46] signed char var_1_32 = 2; [L47] signed long int var_1_34 = -4; [L48] double var_1_38 = 0.5; [L49] unsigned long int last_1_var_1_1 = 64; [L50] unsigned char last_1_var_1_11 = 50; VAL [isInitial=0, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_1 = var_1_1 [L175] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L142] var_1_7 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L145] var_1_9 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0] [L146] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L148] var_1_10 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L151] var_1_12 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L154] var_1_13 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L157] var_1_16 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L159] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L160] var_1_17 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L162] var_1_19 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L164] var_1_20 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L166] var_1_21 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L168] var_1_22 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L170] var_1_23 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L186] RET updateVariables() [L187] CALL step() [L54] signed long int stepLocal_1 = last_1_var_1_11; [L55] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L56] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L57] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L61] COND TRUE ((((var_1_7) < (var_1_13)) ? (var_1_7) : (var_1_13))) <= var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L62] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L78] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=-2147483649, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L79] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=-2147483649, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L79] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L80] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L91] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L93] COND TRUE (~ (5 + var_1_12)) >= 10000u [L94] var_1_29 = (((((var_1_1 + var_1_12)) > (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) ? ((var_1_1 + var_1_12)) : (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L98] EXPR var_1_12 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L98] EXPR ((var_1_12) < ((var_1_12 | -5))) ? (var_1_12) : ((var_1_12 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L98] EXPR var_1_12 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L98] EXPR ((var_1_12) < ((var_1_12 | -5))) ? (var_1_12) : ((var_1_12 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L98] COND FALSE !(var_1_11 <= ((((var_1_12) < ((var_1_12 | -5))) ? (var_1_12) : ((var_1_12 | -5))))) [L103] var_1_38 = var_1_22 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L104] COND FALSE !(! (var_1_11 >= var_1_11)) [L111] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L113] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L118] COND FALSE !((~ (var_1_5 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L121] COND FALSE !(\read(var_1_10)) [L124] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L126] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L127] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L130] COND FALSE !(var_1_12 > var_1_12) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L133] var_1_31 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=-2147483649, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L178] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L178-L179] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=-2147483649, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 12, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2215 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2195 mSDsluCounter, 4253 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2801 mSDsCounter, 721 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3199 IncrementalHoareTripleChecker+Invalid, 3920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 721 mSolverCounterUnsat, 1452 mSDtfsCounter, 3199 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1250 GetRequests, 1136 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=416occurred in iteration=9, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 726 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2707 NumberOfCodeBlocks, 2707 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2845 ConstructedInterpolants, 0 QuantifiedInterpolants, 8524 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1480 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 16248/16632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 23:01:51,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.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 f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:01:52,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:01:53,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 23:01:53,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:01:53,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:01:53,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:01:53,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:01:53,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:01:53,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:01:53,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:01:53,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:01:53,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:01:53,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:01:53,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:01:53,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 23:01:53,070 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:01:53,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:01:53,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:01:53,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:01:53,071 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 -> f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 [2025-02-05 23:01:53,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:01:53,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:01:53,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:01:53,357 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:01:53,357 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:01:53,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2025-02-05 23:01:54,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59c98fb1d/33534c0cec1d47ec8b51aa3c91be5925/FLAG4d5c72a76 [2025-02-05 23:01:54,750 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:01:54,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2025-02-05 23:01:54,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59c98fb1d/33534c0cec1d47ec8b51aa3c91be5925/FLAG4d5c72a76 [2025-02-05 23:01:55,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59c98fb1d/33534c0cec1d47ec8b51aa3c91be5925 [2025-02-05 23:01:55,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:01:55,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:01:55,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:01:55,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:01:55,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:01:55,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bde1d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55, skipping insertion in model container [2025-02-05 23:01:55,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:01:55,216 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_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2025-02-05 23:01:55,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:01:55,299 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:01:55,307 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_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2025-02-05 23:01:55,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:01:55,360 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:01:55,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55 WrapperNode [2025-02-05 23:01:55,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:01:55,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:01:55,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:01:55,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:01:55,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,407 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-02-05 23:01:55,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:01:55,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:01:55,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:01:55,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:01:55,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,436 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 23:01:55,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:01:55,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:01:55,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:01:55,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:01:55,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (1/1) ... [2025-02-05 23:01:55,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:01:55,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:01:55,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:01:55,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:01:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:01:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 23:01:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:01:55,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:01:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:01:55,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:01:55,559 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:01:55,563 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:01:58,739 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 23:01:58,739 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:01:58,746 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:01:58,747 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:01:58,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:01:58 BoogieIcfgContainer [2025-02-05 23:01:58,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:01:58,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:01:58,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:01:58,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:01:58,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:01:55" (1/3) ... [2025-02-05 23:01:58,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c48dacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:01:58, skipping insertion in model container [2025-02-05 23:01:58,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:01:55" (2/3) ... [2025-02-05 23:01:58,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c48dacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:01:58, skipping insertion in model container [2025-02-05 23:01:58,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:01:58" (3/3) ... [2025-02-05 23:01:58,753 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2025-02-05 23:01:58,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:01:58,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:01:58,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:01:58,805 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;@4ac13ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:01:58,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:01:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 23:01:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 23:01:58,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:58,816 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:58,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:58,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:58,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1353084228, now seen corresponding path program 1 times [2025-02-05 23:01:58,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:01:58,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143634369] [2025-02-05 23:01:58,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:58,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:01:58,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:01:58,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:01:58,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 23:01:58,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 23:01:59,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 23:01:59,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:59,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:59,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:01:59,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:01:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-05 23:01:59,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:01:59,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:01:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143634369] [2025-02-05 23:01:59,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143634369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:59,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:59,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:01:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130116106] [2025-02-05 23:01:59,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:59,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:01:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:01:59,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:01:59,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:01:59,200 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:59,216 INFO L93 Difference]: Finished difference Result 152 states and 263 transitions. [2025-02-05 23:01:59,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:01:59,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-02-05 23:01:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:59,222 INFO L225 Difference]: With dead ends: 152 [2025-02-05 23:01:59,222 INFO L226 Difference]: Without dead ends: 75 [2025-02-05 23:01:59,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:01:59,226 INFO L435 NwaCegarLoop]: 112 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, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:59,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:01:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-05 23:01:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-05 23:01:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 23:01:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2025-02-05 23:01:59,256 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 149 [2025-02-05 23:01:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:59,256 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2025-02-05 23:01:59,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2025-02-05 23:01:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 23:01:59,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:59,259 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:59,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-05 23:01:59,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:01:59,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:59,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1313083260, now seen corresponding path program 1 times [2025-02-05 23:01:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:01:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653219551] [2025-02-05 23:01:59,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:59,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:01:59,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:01:59,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:01:59,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 23:01:59,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 23:01:59,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 23:01:59,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:59,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:59,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 23:01:59,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:02:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:02:00,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:02:00,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:02:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653219551] [2025-02-05 23:02:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653219551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:02:00,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:02:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:02:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204949596] [2025-02-05 23:02:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:02:00,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:02:00,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:02:00,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:02:00,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:02:00,601 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:02:02,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:02:04,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:02:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:02:04,061 INFO L93 Difference]: Finished difference Result 220 states and 331 transitions. [2025-02-05 23:02:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:02:04,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-02-05 23:02:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:02:04,084 INFO L225 Difference]: With dead ends: 220 [2025-02-05 23:02:04,084 INFO L226 Difference]: Without dead ends: 148 [2025-02-05 23:02:04,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:02:04,086 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 85 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:02:04,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 341 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 23:02:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-05 23:02:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2025-02-05 23:02:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 23:02:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2025-02-05 23:02:04,103 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 149 [2025-02-05 23:02:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:02:04,103 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2025-02-05 23:02:04,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:02:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2025-02-05 23:02:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:02:04,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:02:04,104 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:02:04,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 23:02:04,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:02:04,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:02:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:02:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash 917386175, now seen corresponding path program 1 times [2025-02-05 23:02:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:02:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566057108] [2025-02-05 23:02:04,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:02:04,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:02:04,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:02:04,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:02:04,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 23:02:04,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:02:04,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:02:04,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:02:04,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:02:04,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 23:02:04,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:02:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:02:05,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:02:05,636 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:02:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566057108] [2025-02-05 23:02:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566057108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:02:05,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:02:05,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:02:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909270623] [2025-02-05 23:02:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:02:05,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:02:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:02:05,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:02:05,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:02:05,640 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:02:08,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:02:10,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:02:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:02:10,266 INFO L93 Difference]: Finished difference Result 220 states and 330 transitions. [2025-02-05 23:02:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:02:10,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 23:02:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:02:10,288 INFO L225 Difference]: With dead ends: 220 [2025-02-05 23:02:10,288 INFO L226 Difference]: Without dead ends: 148 [2025-02-05 23:02:10,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:02:10,289 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 83 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:02:10,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 342 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 23:02:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-05 23:02:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2025-02-05 23:02:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 23:02:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2025-02-05 23:02:10,327 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 150 [2025-02-05 23:02:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:02:10,327 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2025-02-05 23:02:10,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:02:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2025-02-05 23:02:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:02:10,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:02:10,331 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:02:10,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 23:02:10,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:02:10,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:02:10,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:02:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash 508561950, now seen corresponding path program 1 times [2025-02-05 23:02:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:02:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004910291] [2025-02-05 23:02:10,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:02:10,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:02:10,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:02:10,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:02:10,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 23:02:10,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:02:10,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:02:10,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:02:10,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:02:10,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 23:02:10,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:02:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 471 proven. 36 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2025-02-05 23:02:11,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:02:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:02:11,409 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:02:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004910291] [2025-02-05 23:02:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004910291] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:02:11,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:02:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-05 23:02:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976957176] [2025-02-05 23:02:11,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 23:02:11,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 23:02:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:02:11,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 23:02:11,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:02:11,413 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-05 23:02:14,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:02:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:02:14,520 INFO L93 Difference]: Finished difference Result 206 states and 298 transitions. [2025-02-05 23:02:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:02:14,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 150 [2025-02-05 23:02:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:02:14,522 INFO L225 Difference]: With dead ends: 206 [2025-02-05 23:02:14,522 INFO L226 Difference]: Without dead ends: 134 [2025-02-05 23:02:14,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:02:14,523 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 85 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:02:14,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 188 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 23:02:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-05 23:02:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2025-02-05 23:02:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 23:02:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 179 transitions. [2025-02-05 23:02:14,535 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 179 transitions. Word has length 150 [2025-02-05 23:02:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:02:14,535 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 179 transitions. [2025-02-05 23:02:14,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-05 23:02:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 179 transitions. [2025-02-05 23:02:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:02:14,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:02:14,537 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:02:14,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 23:02:14,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:02:14,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:02:14,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:02:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1298892513, now seen corresponding path program 1 times [2025-02-05 23:02:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:02:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468052059] [2025-02-05 23:02:14,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:02:14,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:02:14,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:02:14,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:02:14,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-05 23:02:14,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:02:15,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:02:15,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:02:15,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:02:15,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-05 23:02:15,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:03:03,445 WARN L286 SmtUtils]: Spent 18.08s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)