./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-57.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_operatoramount_amount50_file-57.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 9394c451a16875be2f07cd92f9bb9a3f6ac7cf1ec93151080e071cd31833ec0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:53:15,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:53:15,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:53:15,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:53:15,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:53:15,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:53:15,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:53:15,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:53:15,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:53:15,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:53:15,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:53:15,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:53:15,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:53:15,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:53:15,165 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:53:15,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:53:15,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:53:15,166 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:53:15,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:53:15,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:53:15,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:53:15,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:53:15,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:53:15,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:53:15,166 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:53:15,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:53:15,167 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:53:15,167 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:53:15,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:53:15,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:53:15,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:53:15,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:53:15,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:53:15,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:53:15,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:53:15,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:53:15,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:53:15,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:53:15,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:53:15,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:53:15,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:53:15,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:53:15,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:53:15,169 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 -> 9394c451a16875be2f07cd92f9bb9a3f6ac7cf1ec93151080e071cd31833ec0c [2025-02-06 02:53:15,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:53:15,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:53:15,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:53:15,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:53:15,472 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:53:15,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-57.i [2025-02-06 02:53:16,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/484ae34fe/1aa652ffeb644faabd211a1b6382b235/FLAG344a2dc51 [2025-02-06 02:53:17,038 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:53:17,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-57.i [2025-02-06 02:53:17,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/484ae34fe/1aa652ffeb644faabd211a1b6382b235/FLAG344a2dc51 [2025-02-06 02:53:17,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/484ae34fe/1aa652ffeb644faabd211a1b6382b235 [2025-02-06 02:53:17,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:53:17,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:53:17,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:53:17,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:53:17,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:53:17,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76995b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17, skipping insertion in model container [2025-02-06 02:53:17,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:53:17,209 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_operatoramount_amount50_file-57.i[915,928] [2025-02-06 02:53:17,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:53:17,270 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:53:17,280 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_operatoramount_amount50_file-57.i[915,928] [2025-02-06 02:53:17,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:53:17,335 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:53:17,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17 WrapperNode [2025-02-06 02:53:17,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:53:17,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:53:17,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:53:17,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:53:17,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,397 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-02-06 02:53:17,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:53:17,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:53:17,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:53:17,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:53:17,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,422 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:53:17,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,430 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:53:17,441 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:53:17,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:53:17,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:53:17,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (1/1) ... [2025-02-06 02:53:17,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:53:17,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:53:17,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:53:17,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:53:17,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:53:17,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:53:17,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:53:17,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:53:17,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:53:17,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:53:17,576 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:53:17,578 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:53:17,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2025-02-06 02:53:17,959 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-06 02:53:17,960 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:53:17,979 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:53:17,979 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:53:17,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:53:17 BoogieIcfgContainer [2025-02-06 02:53:17,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:53:17,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:53:17,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:53:17,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:53:17,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:53:17" (1/3) ... [2025-02-06 02:53:17,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:53:17, skipping insertion in model container [2025-02-06 02:53:17,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:17" (2/3) ... [2025-02-06 02:53:17,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:53:17, skipping insertion in model container [2025-02-06 02:53:17,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:53:17" (3/3) ... [2025-02-06 02:53:17,990 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-57.i [2025-02-06 02:53:18,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:53:18,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-57.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:53:18,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:53:18,071 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;@4bf4d24b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:53:18,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:53:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 62 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 02:53:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 02:53:18,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:53:18,090 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:53:18,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:53:18,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:53:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1283673567, now seen corresponding path program 1 times [2025-02-06 02:53:18,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:53:18,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269321745] [2025-02-06 02:53:18,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:18,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:53:18,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 02:53:18,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 02:53:18,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:18,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:53:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 02:53:18,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:53:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269321745] [2025-02-06 02:53:18,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269321745] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:53:18,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805981948] [2025-02-06 02:53:18,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:53:18,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:53:18,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:53:18,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:53:18,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 02:53:18,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 02:53:18,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:18,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:53:18,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:53:18,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:53:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 02:53:18,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:53:18,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805981948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:53:18,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:53:18,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:53:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22385601] [2025-02-06 02:53:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:53:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:53:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:53:18,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:53:18,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:53:18,688 INFO L87 Difference]: Start difference. First operand has 90 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 62 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:53:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:53:18,729 INFO L93 Difference]: Finished difference Result 174 states and 295 transitions. [2025-02-06 02:53:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:53:18,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-02-06 02:53:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:53:18,739 INFO L225 Difference]: With dead ends: 174 [2025-02-06 02:53:18,740 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 02:53:18,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:53:18,748 INFO L435 NwaCegarLoop]: 128 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, 128 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:53:18,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:53:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 02:53:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 02:53:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 02:53:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2025-02-06 02:53:18,802 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 169 [2025-02-06 02:53:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:53:18,803 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2025-02-06 02:53:18,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:53:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2025-02-06 02:53:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 02:53:18,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:53:18,807 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:53:18,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:53:19,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:53:19,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:53:19,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:53:19,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1742715643, now seen corresponding path program 1 times [2025-02-06 02:53:19,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:53:19,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827590796] [2025-02-06 02:53:19,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:19,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:53:19,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 02:53:19,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 02:53:19,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:19,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:53:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-06 02:53:19,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:53:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827590796] [2025-02-06 02:53:19,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827590796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:53:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464800816] [2025-02-06 02:53:19,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:19,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:53:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:53:19,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:53:19,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:53:19,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 02:53:19,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 02:53:19,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:19,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:53:19,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:53:19,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:53:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 213 proven. 69 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-02-06 02:53:20,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:53:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-06 02:53:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464800816] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:53:20,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:53:20,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 02:53:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371741347] [2025-02-06 02:53:20,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:53:20,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:53:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:53:20,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:53:20,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:53:20,567 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:53:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:53:21,026 INFO L93 Difference]: Finished difference Result 179 states and 269 transitions. [2025-02-06 02:53:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:53:21,027 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 169 [2025-02-06 02:53:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:53:21,029 INFO L225 Difference]: With dead ends: 179 [2025-02-06 02:53:21,029 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 02:53:21,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:53:21,030 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 61 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:53:21,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 414 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:53:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 02:53:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-02-06 02:53:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 02:53:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2025-02-06 02:53:21,075 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 169 [2025-02-06 02:53:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:53:21,075 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2025-02-06 02:53:21,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:53:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2025-02-06 02:53:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 02:53:21,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:53:21,078 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:53:21,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:53:21,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:53:21,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:53:21,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:53:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2046693028, now seen corresponding path program 1 times [2025-02-06 02:53:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:53:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309996082] [2025-02-06 02:53:21,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:53:21,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 02:53:21,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 02:53:21,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:21,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:53:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:53:22,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:53:22,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309996082] [2025-02-06 02:53:22,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309996082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:53:22,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:53:22,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:53:22,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068706548] [2025-02-06 02:53:22,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:53:22,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:53:22,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:53:22,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:53:22,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:53:22,024 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:53:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:53:23,077 INFO L93 Difference]: Finished difference Result 436 states and 635 transitions. [2025-02-06 02:53:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:53:23,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-02-06 02:53:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:53:23,082 INFO L225 Difference]: With dead ends: 436 [2025-02-06 02:53:23,082 INFO L226 Difference]: Without dead ends: 346 [2025-02-06 02:53:23,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:53:23,084 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 459 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:53:23,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 752 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:53:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-02-06 02:53:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 315. [2025-02-06 02:53:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 226 states have (on average 1.345132743362832) internal successors, (304), 228 states have internal predecessors, (304), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 02:53:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 464 transitions. [2025-02-06 02:53:23,141 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 464 transitions. Word has length 169 [2025-02-06 02:53:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:53:23,142 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 464 transitions. [2025-02-06 02:53:23,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:53:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 464 transitions. [2025-02-06 02:53:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 02:53:23,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:53:23,145 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:53:23,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:53:23,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:53:23,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:53:23,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1706665521, now seen corresponding path program 1 times [2025-02-06 02:53:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:53:23,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620966289] [2025-02-06 02:53:23,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:53:23,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 02:53:23,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 02:53:23,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:23,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:53:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:53:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:53:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620966289] [2025-02-06 02:53:23,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620966289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:53:23,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:53:23,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:53:23,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437026172] [2025-02-06 02:53:23,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:53:23,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:53:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:53:23,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:53:23,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:53:23,477 INFO L87 Difference]: Start difference. First operand 315 states and 464 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:53:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:53:24,038 INFO L93 Difference]: Finished difference Result 775 states and 1133 transitions. [2025-02-06 02:53:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:53:24,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-02-06 02:53:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:53:24,048 INFO L225 Difference]: With dead ends: 775 [2025-02-06 02:53:24,050 INFO L226 Difference]: Without dead ends: 463 [2025-02-06 02:53:24,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:53:24,055 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 333 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:53:24,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 591 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:53:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-02-06 02:53:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 331. [2025-02-06 02:53:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 242 states have (on average 1.359504132231405) internal successors, (329), 244 states have internal predecessors, (329), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 02:53:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 489 transitions. [2025-02-06 02:53:24,126 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 489 transitions. Word has length 170 [2025-02-06 02:53:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:53:24,127 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 489 transitions. [2025-02-06 02:53:24,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:53:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 489 transitions. [2025-02-06 02:53:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 02:53:24,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:53:24,131 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:53:24,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:53:24,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:53:24,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:53:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1410525486, now seen corresponding path program 1 times [2025-02-06 02:53:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:53:24,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933366818] [2025-02-06 02:53:24,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:24,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:53:24,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 02:53:24,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 02:53:24,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:24,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:53:24,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229496089] [2025-02-06 02:53:24,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:24,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:53:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:53:24,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:53:24,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:53:24,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 02:53:24,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 02:53:24,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:24,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:53:24,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:53:24,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 02:53:24,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 02:53:24,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:24,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:53:24,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:53:24,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:53:24,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:53:24,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:53:24,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:53:24,693 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 02:53:24,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:53:24,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:53:24 BoogieIcfgContainer [2025-02-06 02:53:24,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:53:24,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:53:24,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:53:24,791 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:53:24,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:53:17" (3/4) ... [2025-02-06 02:53:24,794 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:53:24,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:53:24,795 INFO L158 Benchmark]: Toolchain (without parser) took 7734.73ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.5MB in the beginning and 167.0MB in the end (delta: -54.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2025-02-06 02:53:24,795 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:53:24,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.13ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:53:24,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.97ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:53:24,796 INFO L158 Benchmark]: Boogie Preprocessor took 40.33ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 89.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:53:24,796 INFO L158 Benchmark]: IcfgBuilder took 538.31ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 60.5MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 02:53:24,796 INFO L158 Benchmark]: TraceAbstraction took 6808.16ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 59.6MB in the beginning and 167.0MB in the end (delta: -107.4MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2025-02-06 02:53:24,796 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 218.1MB. Free memory was 167.0MB in the beginning and 167.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:53:24,799 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.13ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.97ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.33ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 89.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 538.31ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 60.5MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6808.16ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 59.6MB in the beginning and 167.0MB in the end (delta: -107.4MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 218.1MB. Free memory was 167.0MB in the beginning and 167.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_5 = 5; [L26] unsigned char var_1_6 = 0; [L27] double var_1_7 = 24.8; [L28] double var_1_8 = 500.5; [L29] double var_1_9 = 2.4; [L30] double var_1_10 = 0.4; [L31] double var_1_11 = 255.8; [L32] double var_1_12 = 50.75; [L33] unsigned char var_1_13 = 4; [L34] unsigned char var_1_14 = 200; [L35] unsigned char var_1_15 = 25; [L36] unsigned char var_1_16 = 128; [L37] unsigned char var_1_17 = 64; [L38] unsigned char var_1_18 = 32; [L39] unsigned char var_1_19 = 32; [L40] unsigned long int var_1_20 = 1; [L41] float var_1_21 = 9999999999.2; [L42] double var_1_23 = 10.875; VAL [isInitial=0, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=-1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] FCALL updateLastVariables() [L141] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L89] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L90] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L90] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L91] var_1_3 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L93] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L93] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L94] var_1_5 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L95] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L97] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L97] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L98] var_1_6 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L99] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L100] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L100] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L101] var_1_8 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L102] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L103] var_1_9 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L104] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L105] var_1_10 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L106] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L107] var_1_11 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L108] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L109] var_1_12 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L110] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L111] var_1_14 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L112] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L113] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L113] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L114] var_1_15 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L115] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L116] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L116] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L117] var_1_16 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L118] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L119] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L119] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L120] var_1_17 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L121] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L122] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L122] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L123] var_1_18 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L124] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L125] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L125] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L126] var_1_19 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L127] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L128] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L128] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L141] RET updateVariables() [L142] CALL step() [L46] signed char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L47] COND TRUE -256 <= stepLocal_0 [L48] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L54] COND TRUE var_1_11 <= var_1_9 [L55] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L57] COND TRUE (var_1_2 - var_1_3) > (var_1_13 / var_1_5) [L58] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L66] EXPR (var_1_2 * var_1_13) & var_1_1 VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L66] signed long int stepLocal_1 = (var_1_2 * var_1_13) & var_1_1; [L67] COND FALSE !(var_1_3 < stepLocal_1) VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L70] EXPR var_1_1 & var_1_3 VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L70] signed long int stepLocal_2 = var_1_1 & var_1_3; [L71] COND FALSE !((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= stepLocal_2) [L78] var_1_21 = var_1_12 VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L80] unsigned long int stepLocal_3 = var_1_20; VAL [isInitial=1, stepLocal_3=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L81] COND TRUE var_1_1 > stepLocal_3 VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L82] COND TRUE ! (! var_1_6) [L83] var_1_23 = var_1_8 VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L133] EXPR ((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L133-L134] return (((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_20) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L19] reach_error() VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 855 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 853 mSDsluCounter, 1885 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1273 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1734 IncrementalHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 612 mSDtfsCounter, 1734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 549 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=4, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 165 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 2417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 8843/9100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 02:53:24,824 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_operatoramount_amount50_file-57.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 9394c451a16875be2f07cd92f9bb9a3f6ac7cf1ec93151080e071cd31833ec0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:53:27,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:53:27,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:53:27,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:53:27,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:53:27,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:53:27,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:53:27,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:53:27,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:53:27,166 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:53:27,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:53:27,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:53:27,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:53:27,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:53:27,167 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:53:27,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:53:27,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:53:27,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:53:27,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:53:27,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:53:27,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:53:27,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:53:27,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:53:27,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:53:27,171 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 -> 9394c451a16875be2f07cd92f9bb9a3f6ac7cf1ec93151080e071cd31833ec0c [2025-02-06 02:53:27,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:53:27,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:53:27,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:53:27,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:53:27,467 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:53:27,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-57.i [2025-02-06 02:53:28,768 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6990e539/fd234552b987421e88b537b5537bf827/FLAG8d5374bba [2025-02-06 02:53:29,029 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:53:29,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-57.i [2025-02-06 02:53:29,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6990e539/fd234552b987421e88b537b5537bf827/FLAG8d5374bba [2025-02-06 02:53:29,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6990e539/fd234552b987421e88b537b5537bf827 [2025-02-06 02:53:29,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:53:29,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:53:29,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:53:29,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:53:29,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:53:29,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28691084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29, skipping insertion in model container [2025-02-06 02:53:29,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:53:29,222 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_operatoramount_amount50_file-57.i[915,928] [2025-02-06 02:53:29,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:53:29,311 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:53:29,326 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_operatoramount_amount50_file-57.i[915,928] [2025-02-06 02:53:29,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:53:29,372 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:53:29,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29 WrapperNode [2025-02-06 02:53:29,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:53:29,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:53:29,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:53:29,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:53:29,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,417 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-02-06 02:53:29,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:53:29,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:53:29,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:53:29,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:53:29,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:53:29,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:53:29,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:53:29,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:53:29,500 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:53:29,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (1/1) ... [2025-02-06 02:53:29,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:53:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:53:29,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:53:29,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:53:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:53:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:53:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:53:29,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:53:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:53:29,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:53:29,628 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:53:29,629 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:53:36,979 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-06 02:53:36,979 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:53:36,991 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:53:36,993 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:53:36,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:53:36 BoogieIcfgContainer [2025-02-06 02:53:36,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:53:36,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:53:36,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:53:37,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:53:37,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:53:29" (1/3) ... [2025-02-06 02:53:37,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d90be90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:53:37, skipping insertion in model container [2025-02-06 02:53:37,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:53:29" (2/3) ... [2025-02-06 02:53:37,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d90be90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:53:37, skipping insertion in model container [2025-02-06 02:53:37,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:53:36" (3/3) ... [2025-02-06 02:53:37,004 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-57.i [2025-02-06 02:53:37,015 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:53:37,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-57.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:53:37,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:53:37,073 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;@33448fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:53:37,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:53:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 02:53:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 02:53:37,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:53:37,095 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:53:37,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:53:37,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:53:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash -335512568, now seen corresponding path program 1 times [2025-02-06 02:53:37,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:53:37,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365148174] [2025-02-06 02:53:37,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:37,117 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-06 02:53:37,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:53:37,120 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-06 02:53:37,122 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-06 02:53:37,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 02:53:37,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 02:53:37,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:37,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:53:37,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:53:37,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:53:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2025-02-06 02:53:37,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:53:37,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:53:37,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365148174] [2025-02-06 02:53:37,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365148174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:53:37,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:53:37,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:53:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054478590] [2025-02-06 02:53:37,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:53:37,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:53:37,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:53:37,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:53:37,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:53:37,705 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:53:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:53:37,751 INFO L93 Difference]: Finished difference Result 137 states and 237 transitions. [2025-02-06 02:53:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:53:37,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-02-06 02:53:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:53:37,758 INFO L225 Difference]: With dead ends: 137 [2025-02-06 02:53:37,758 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 02:53:37,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:53:37,763 INFO L435 NwaCegarLoop]: 101 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, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:53:37,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:53:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 02:53:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 02:53:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 02:53:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2025-02-06 02:53:37,808 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 163 [2025-02-06 02:53:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:53:37,809 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2025-02-06 02:53:37,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:53:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2025-02-06 02:53:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 02:53:37,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:53:37,813 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:53:37,835 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-06 02:53:38,013 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-06 02:53:38,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:53:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:53:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1410004500, now seen corresponding path program 1 times [2025-02-06 02:53:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:53:38,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279509154] [2025-02-06 02:53:38,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:53:38,016 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-06 02:53:38,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:53:38,018 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-06 02:53:38,019 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-06 02:53:38,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 02:53:38,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 02:53:38,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:53:38,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:53:38,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 02:53:38,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:54:37,216 WARN L286 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 02:54:45,285 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)