./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.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 539063f6ba473db54ff36149ccd453fdab8b89daa6bb5c4360e0c863033e7c3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:36:17,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:36:18,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:36:18,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:36:18,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:36:18,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:36:18,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:36:18,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:36:18,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:36:18,053 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:36:18,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:36:18,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:36:18,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:36:18,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:36:18,055 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:36:18,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:36:18,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:36:18,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:36:18,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:36:18,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:36:18,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:36:18,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:36:18,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:36:18,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:36:18,056 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:36:18,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:36:18,057 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:36:18,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:36:18,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:36:18,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:36:18,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:36:18,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:36:18,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:18,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:36:18,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:36:18,058 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:36:18,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:36:18,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:36:18,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:36:18,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:36:18,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:36:18,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:36:18,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:36:18,059 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 -> 539063f6ba473db54ff36149ccd453fdab8b89daa6bb5c4360e0c863033e7c3e [2025-02-05 20:36:18,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:36:18,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:36:18,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:36:18,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:36:18,376 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:36:18,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i [2025-02-05 20:36:19,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e2a9a8b4/fbbd0bb353e849fc9df12b2bf5587b52/FLAGe687cd04b [2025-02-05 20:36:20,026 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:36:20,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i [2025-02-05 20:36:20,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e2a9a8b4/fbbd0bb353e849fc9df12b2bf5587b52/FLAGe687cd04b [2025-02-05 20:36:20,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e2a9a8b4/fbbd0bb353e849fc9df12b2bf5587b52 [2025-02-05 20:36:20,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:36:20,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:36:20,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:20,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:36:20,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:36:20,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e85c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20, skipping insertion in model container [2025-02-05 20:36:20,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:36:20,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i[913,926] [2025-02-05 20:36:20,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:20,313 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:36:20,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i[913,926] [2025-02-05 20:36:20,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:20,373 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:36:20,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20 WrapperNode [2025-02-05 20:36:20,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:20,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:20,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:36:20,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:36:20,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,418 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2025-02-05 20:36:20,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:20,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:36:20,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:36:20,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:36:20,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,446 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:36:20,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:36:20,468 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:36:20,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:36:20,468 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:36:20,469 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (1/1) ... [2025-02-05 20:36:20,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:20,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:20,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:36:20,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:36:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:36:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:36:20,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:36:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:36:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:36:20,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:36:20,615 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:36:20,617 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:36:20,950 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-02-05 20:36:20,978 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 20:36:20,979 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:36:20,995 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:36:20,996 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-05 20:36:20,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:20 BoogieIcfgContainer [2025-02-05 20:36:20,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:36:20,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:36:20,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:36:21,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:36:21,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:36:20" (1/3) ... [2025-02-05 20:36:21,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be03e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:21, skipping insertion in model container [2025-02-05 20:36:21,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:20" (2/3) ... [2025-02-05 20:36:21,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be03e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:21, skipping insertion in model container [2025-02-05 20:36:21,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:20" (3/3) ... [2025-02-05 20:36:21,005 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-53.i [2025-02-05 20:36:21,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:36:21,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-53.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:36:21,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:36:21,097 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;@babeddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:36:21,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:36:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 20:36:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 20:36:21,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:21,119 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:36:21,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:21,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash -831376962, now seen corresponding path program 1 times [2025-02-05 20:36:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:21,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200898309] [2025-02-05 20:36:21,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:21,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 20:36:21,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 20:36:21,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:21,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-02-05 20:36:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:36:21,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200898309] [2025-02-05 20:36:21,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200898309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:36:21,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331366659] [2025-02-05 20:36:21,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:21,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:21,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:21,442 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:36:21,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:36:21,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 20:36:21,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 20:36:21,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:21,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:21,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:36:21,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-02-05 20:36:21,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:36:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331366659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:36:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:36:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:36:21,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646539823] [2025-02-05 20:36:21,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:36:21,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:36:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:36:21,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:36:21,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:36:21,719 INFO L87 Difference]: Start difference. First operand has 90 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 20:36:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:21,762 INFO L93 Difference]: Finished difference Result 174 states and 300 transitions. [2025-02-05 20:36:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:36:21,765 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 180 [2025-02-05 20:36:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:21,771 INFO L225 Difference]: With dead ends: 174 [2025-02-05 20:36:21,773 INFO L226 Difference]: Without dead ends: 87 [2025-02-05 20:36:21,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:36:21,781 INFO L435 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:36:21,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:36:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-05 20:36:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-05 20:36:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 20:36:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2025-02-05 20:36:21,833 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 180 [2025-02-05 20:36:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:21,834 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2025-02-05 20:36:21,834 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 20:36:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2025-02-05 20:36:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 20:36:21,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:21,838 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:36:21,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:36:22,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:36:22,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:22,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1601089305, now seen corresponding path program 1 times [2025-02-05 20:36:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706157783] [2025-02-05 20:36:22,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:22,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 20:36:22,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 20:36:22,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:22,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 20:36:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:36:22,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706157783] [2025-02-05 20:36:22,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706157783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:36:22,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:36:22,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:36:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173540113] [2025-02-05 20:36:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:36:22,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:36:22,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:36:22,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:36:22,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:36:22,315 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 20:36:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:22,402 INFO L93 Difference]: Finished difference Result 246 states and 378 transitions. [2025-02-05 20:36:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:36:22,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 180 [2025-02-05 20:36:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:22,406 INFO L225 Difference]: With dead ends: 246 [2025-02-05 20:36:22,407 INFO L226 Difference]: Without dead ends: 162 [2025-02-05 20:36:22,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:36:22,408 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 123 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:36:22,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 250 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:36:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-05 20:36:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2025-02-05 20:36:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 20:36:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 244 transitions. [2025-02-05 20:36:22,451 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 244 transitions. Word has length 180 [2025-02-05 20:36:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:22,452 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 244 transitions. [2025-02-05 20:36:22,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 20:36:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 244 transitions. [2025-02-05 20:36:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 20:36:22,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:22,456 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:36:22,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:36:22,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:22,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:22,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1377906777, now seen corresponding path program 1 times [2025-02-05 20:36:22,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:22,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790707267] [2025-02-05 20:36:22,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:22,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:22,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 20:36:22,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 20:36:22,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:22,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:36:22,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592073027] [2025-02-05 20:36:22,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:22,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:22,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:22,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:36:22,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:36:22,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 20:36:22,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 20:36:22,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:22,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:36:22,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:36:22,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 20:36:23,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 20:36:23,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:23,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:36:23,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:36:23,131 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:36:23,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:36:23,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:36:23,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:23,337 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-05 20:36:23,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:36:23,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:36:23 BoogieIcfgContainer [2025-02-05 20:36:23,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:36:23,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:36:23,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:36:23,459 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:36:23,461 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:20" (3/4) ... [2025-02-05 20:36:23,463 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:36:23,464 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:36:23,465 INFO L158 Benchmark]: Toolchain (without parser) took 3407.18ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 66.6MB in the end (delta: 45.6MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2025-02-05 20:36:23,466 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:23,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.17ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.2MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:36:23,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.37ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:23,470 INFO L158 Benchmark]: Boogie Preprocessor took 48.03ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:23,470 INFO L158 Benchmark]: IcfgBuilder took 527.96ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 69.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:36:23,470 INFO L158 Benchmark]: TraceAbstraction took 2460.12ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 66.6MB in the end (delta: 2.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2025-02-05 20:36:23,470 INFO L158 Benchmark]: Witness Printer took 5.36ms. Allocated memory is still 142.6MB. Free memory was 66.6MB in the beginning and 66.6MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:23,472 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.17ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.2MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.37ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.03ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 527.96ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 69.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2460.12ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 66.6MB in the end (delta: 2.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Witness Printer took 5.36ms. Allocated memory is still 142.6MB. Free memory was 66.6MB in the beginning and 66.6MB in the end (delta: 24.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 someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryArithmeticFLOAToperation at line 59, overapproximation of someUnaryFLOAToperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] signed char var_1_2 = -64; [L24] signed char var_1_3 = -1; [L25] signed long int var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] signed long int var_1_6 = 4; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned long int var_1_9 = 10; [L31] float var_1_10 = 99.5; [L32] float var_1_11 = 5.6; [L33] float var_1_12 = 255.5; [L34] float var_1_13 = 31.25; [L35] signed short int var_1_14 = 32; [L36] unsigned long int var_1_15 = 16; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 5; [L39] unsigned char var_1_18 = 50; [L40] unsigned char var_1_19 = 50; [L41] signed char var_1_20 = 1; [L42] signed char var_1_21 = -10; [L43] float var_1_22 = 0.5; [L44] signed char var_1_23 = 100; VAL [isInitial=0, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=-64, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] FCALL updateLastVariables() [L140] CALL updateVariables() [L84] var_1_2 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L85] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L86] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L86] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L87] var_1_3 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L88] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L89] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L89] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L90] var_1_4 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L91] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L92] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L93] var_1_5 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L94] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L95] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L96] var_1_6 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=10] [L97] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=10] [L98] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=10] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_8=0, var_1_9=10] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_8=0, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=10] [L101] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=0, var_1_9=10] [L102] var_1_8 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L103] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L104] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L104] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L105] var_1_11 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L106] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L107] var_1_12 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L108] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L109] var_1_13 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L110] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L111] var_1_15 = __VERIFIER_nondet_ulong() [L112] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L112] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L113] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L113] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L114] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L114] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L115] var_1_17 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L116] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L117] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L117] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L118] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L118] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L121] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L121] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L124] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L124] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L125] var_1_21 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L126] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L127] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L127] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L140] RET updateVariables() [L141] CALL step() [L48] COND TRUE (var_1_2 * var_1_3) == var_1_4 VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L49] COND TRUE (var_1_4 > (var_1_5 - var_1_6)) && var_1_7 [L50] var_1_1 = var_1_8 VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L53] COND TRUE (var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=10] [L54] COND TRUE ((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5) [L55] var_1_9 = var_1_6 VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] [L58] COND TRUE (! var_1_1) || var_1_8 [L59] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] [L67] COND TRUE \read(var_1_1) [L68] var_1_14 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] [L76] EXPR 256u << var_1_2 VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] [L76] COND TRUE (((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2) [L77] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, var_1_10=2, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] [L79] var_1_20 = var_1_21 [L80] var_1_22 = var_1_12 [L81] var_1_23 = var_1_21 VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] [L141] RET step() [L142] CALL, EXPR property() [L132] EXPR (((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] [L132] EXPR ((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] [L132-L133] return (((((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=3, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=10, var_1_6=11, var_1_7=1, var_1_8=1, var_1_9=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 379 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 274 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 537 ConstructedInterpolants, 0 QuantifiedInterpolants, 545 SizeOfPredicates, 0 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 4816/4872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 20:36:23,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.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 539063f6ba473db54ff36149ccd453fdab8b89daa6bb5c4360e0c863033e7c3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:36:25,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:36:25,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:36:25,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:36:25,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:36:25,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:36:25,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:36:25,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:36:25,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:36:25,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:36:25,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:36:25,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:36:25,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:36:25,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:36:25,855 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:36:25,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:25,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:36:25,856 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:36:25,857 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:36:25,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:36:25,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:36:25,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:36:25,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:36:25,857 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 -> 539063f6ba473db54ff36149ccd453fdab8b89daa6bb5c4360e0c863033e7c3e [2025-02-05 20:36:26,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:36:26,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:36:26,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:36:26,186 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:36:26,186 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:36:26,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i [2025-02-05 20:36:27,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e22c6078/2fe42ef7547c4517b93ee027144004b2/FLAGef434962a [2025-02-05 20:36:27,827 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:36:27,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i [2025-02-05 20:36:27,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e22c6078/2fe42ef7547c4517b93ee027144004b2/FLAGef434962a [2025-02-05 20:36:27,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e22c6078/2fe42ef7547c4517b93ee027144004b2 [2025-02-05 20:36:27,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:36:27,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:36:27,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:27,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:36:27,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:36:27,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:27" (1/1) ... [2025-02-05 20:36:27,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552c5caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:27, skipping insertion in model container [2025-02-05 20:36:27,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:27" (1/1) ... [2025-02-05 20:36:27,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:36:28,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i[913,926] [2025-02-05 20:36:28,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:28,109 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:36:28,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-53.i[913,926] [2025-02-05 20:36:28,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:28,160 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:36:28,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28 WrapperNode [2025-02-05 20:36:28,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:28,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:28,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:36:28,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:36:28,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,225 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-02-05 20:36:28,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:28,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:36:28,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:36:28,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:36:28,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,269 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:36:28,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:36:28,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:36:28,300 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:36:28,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:36:28,302 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (1/1) ... [2025-02-05 20:36:28,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:28,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:36:28,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:36:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:36:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:36:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:36:28,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:36:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:36:28,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:36:28,469 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:36:28,471 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:36:29,139 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:36:29,139 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:36:29,152 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:36:29,153 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:36:29,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:29 BoogieIcfgContainer [2025-02-05 20:36:29,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:36:29,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:36:29,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:36:29,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:36:29,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:36:27" (1/3) ... [2025-02-05 20:36:29,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4694addb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:29, skipping insertion in model container [2025-02-05 20:36:29,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:28" (2/3) ... [2025-02-05 20:36:29,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4694addb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:29, skipping insertion in model container [2025-02-05 20:36:29,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:29" (3/3) ... [2025-02-05 20:36:29,162 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-53.i [2025-02-05 20:36:29,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:36:29,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-53.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:36:29,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:36:29,242 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;@1c9554e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:36:29,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:36:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 20:36:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 20:36:29,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:29,261 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:36:29,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:29,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash -187456318, now seen corresponding path program 1 times [2025-02-05 20:36:29,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:36:29,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546535497] [2025-02-05 20:36:29,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:29,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:36:29,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:36:29,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:36:29,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 20:36:29,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 20:36:29,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 20:36:29,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:29,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:29,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:36:29,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-02-05 20:36:29,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:36:29,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:36:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546535497] [2025-02-05 20:36:29,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546535497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:36:29,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:36:29,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:36:29,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164324813] [2025-02-05 20:36:29,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:36:29,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:36:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:36:29,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:36:29,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:36:29,669 INFO L87 Difference]: Start difference. First operand has 72 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 20:36:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:29,701 INFO L93 Difference]: Finished difference Result 138 states and 246 transitions. [2025-02-05 20:36:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:36:29,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 175 [2025-02-05 20:36:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:29,709 INFO L225 Difference]: With dead ends: 138 [2025-02-05 20:36:29,710 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 20:36:29,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:36:29,718 INFO L435 NwaCegarLoop]: 106 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, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:36:29,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:36:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 20:36:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-05 20:36:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 20:36:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions. [2025-02-05 20:36:29,760 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 175 [2025-02-05 20:36:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:29,760 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 106 transitions. [2025-02-05 20:36:29,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 20:36:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions. [2025-02-05 20:36:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 20:36:29,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:29,768 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:36:29,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 20:36:29,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:36:29,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:29,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2066810233, now seen corresponding path program 1 times [2025-02-05 20:36:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:36:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909441456] [2025-02-05 20:36:29,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:29,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:36:29,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:36:29,977 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:36:29,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 20:36:30,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 20:36:30,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 20:36:30,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:30,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:30,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:36:30,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 20:36:30,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:36:30,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:36:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909441456] [2025-02-05 20:36:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909441456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:36:30,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:36:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:36:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200097110] [2025-02-05 20:36:30,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:36:30,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:36:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:36:30,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:36:30,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:36:30,768 INFO L87 Difference]: Start difference. First operand 69 states and 106 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 20:36:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:31,057 INFO L93 Difference]: Finished difference Result 199 states and 308 transitions. [2025-02-05 20:36:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:36:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 175 [2025-02-05 20:36:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:31,070 INFO L225 Difference]: With dead ends: 199 [2025-02-05 20:36:31,070 INFO L226 Difference]: Without dead ends: 133 [2025-02-05 20:36:31,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:36:31,072 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 17 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:36:31,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:36:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-05 20:36:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2025-02-05 20:36:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 70 states have internal predecessors, (86), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 20:36:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 202 transitions. [2025-02-05 20:36:31,093 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 202 transitions. Word has length 175 [2025-02-05 20:36:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:31,096 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 202 transitions. [2025-02-05 20:36:31,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 20:36:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 202 transitions. [2025-02-05 20:36:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 20:36:31,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:31,099 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:36:31,111 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 (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:36:31,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:36:31,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash -315986114, now seen corresponding path program 1 times [2025-02-05 20:36:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:36:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555174658] [2025-02-05 20:36:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:31,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:36:31,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:36:31,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:36:31,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 20:36:31,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 20:36:31,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 20:36:31,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:31,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:31,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 20:36:31,540 INFO L279 TraceCheckSpWp]: Computing forward predicates...