./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-13.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 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:37:23,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:37:23,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:37:23,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:37:23,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:37:23,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:37:23,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:37:23,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:37:23,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:37:23,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:37:23,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:37:23,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:37:23,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:37:23,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:37:23,497 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:37:23,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:37:23,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:37:23,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:37:23,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:37:23,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:37:23,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:37:23,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:37:23,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:37:23,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:37:23,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:37:23,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:37:23,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:37:23,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:37:23,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:37:23,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:37:23,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:37:23,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:37:23,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:37:23,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:37:23,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:37:23,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:37:23,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:37:23,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:37:23,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:37:23,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:37:23,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:37:23,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:37:23,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:37:23,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:37:23,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:37:23,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:37:23,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:37:23,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:37:23,501 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 -> 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b [2025-01-09 08:37:23,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:37:23,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:37:23,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:37:23,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:37:23,834 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:37:23,837 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-13.i [2025-01-09 08:37:25,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f06352aa/d80c8ad32be947f49f91862fe68b4c18/FLAGb183ad130 [2025-01-09 08:37:25,354 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:37:25,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2025-01-09 08:37:25,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f06352aa/d80c8ad32be947f49f91862fe68b4c18/FLAGb183ad130 [2025-01-09 08:37:25,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f06352aa/d80c8ad32be947f49f91862fe68b4c18 [2025-01-09 08:37:25,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:37:25,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:37:25,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:37:25,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:37:25,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:37:25,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:25,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eaa85da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25, skipping insertion in model container [2025-01-09 08:37:25,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:25,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:37:25,804 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-13.i[913,926] [2025-01-09 08:37:25,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:37:25,885 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:37:25,895 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-13.i[913,926] [2025-01-09 08:37:25,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:37:25,946 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:37:25,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25 WrapperNode [2025-01-09 08:37:25,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:37:25,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:37:25,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:37:25,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:37:25,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:25,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:25,983 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2025-01-09 08:37:25,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:37:25,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:37:25,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:37:25,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:37:25,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:25,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:25,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:26,008 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-01-09 08:37:26,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:26,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:26,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:26,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:26,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:26,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:26,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:26,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:37:26,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:37:26,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:37:26,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:37:26,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (1/1) ... [2025-01-09 08:37:26,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:37:26,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:37:26,054 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-01-09 08:37:26,056 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-01-09 08:37:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:37:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:37:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:37:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:37:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:37:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:37:26,139 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:37:26,140 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:37:26,379 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:37:26,379 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:37:26,391 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:37:26,391 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:37:26,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:37:26 BoogieIcfgContainer [2025-01-09 08:37:26,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:37:26,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:37:26,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:37:26,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:37:26,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:37:25" (1/3) ... [2025-01-09 08:37:26,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344102b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:37:26, skipping insertion in model container [2025-01-09 08:37:26,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:25" (2/3) ... [2025-01-09 08:37:26,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344102b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:37:26, skipping insertion in model container [2025-01-09 08:37:26,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:37:26" (3/3) ... [2025-01-09 08:37:26,401 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-13.i [2025-01-09 08:37:26,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:37:26,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-13.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:37:26,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:37:26,475 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;@5fdadcd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:37:26,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:37:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:37:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 08:37:26,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:37:26,491 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:37:26,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:37:26,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:37:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1101482252, now seen corresponding path program 1 times [2025-01-09 08:37:26,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:37:26,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700621824] [2025-01-09 08:37:26,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:37:26,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:37:26,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:37:26,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:26,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:37:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 08:37:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:37:26,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700621824] [2025-01-09 08:37:26,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700621824] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:37:26,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450687434] [2025-01-09 08:37:26,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:26,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:37:26,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:37:26,746 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-01-09 08:37:26,771 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-01-09 08:37:26,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:37:26,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:37:26,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:26,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:37:26,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:37:26,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:37:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 08:37:26,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:37:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450687434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:37:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:37:26,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:37:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180181491] [2025-01-09 08:37:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:37:26,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:37:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:37:26,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:37:26,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:37:26,983 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 08:37:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:37:27,000 INFO L93 Difference]: Finished difference Result 150 states and 261 transitions. [2025-01-09 08:37:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:37:27,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2025-01-09 08:37:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:37:27,004 INFO L225 Difference]: With dead ends: 150 [2025-01-09 08:37:27,004 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 08:37:27,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 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-01-09 08:37:27,008 INFO L435 NwaCegarLoop]: 113 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, 113 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-01-09 08:37:27,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:37:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 08:37:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-09 08:37:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:37:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-01-09 08:37:27,038 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 176 [2025-01-09 08:37:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:37:27,039 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-01-09 08:37:27,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 08:37:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-01-09 08:37:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 08:37:27,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:37:27,042 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:37:27,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:37:27,243 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-01-09 08:37:27,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:37:27,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:37:27,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1799986172, now seen corresponding path program 1 times [2025-01-09 08:37:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:37:27,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928208179] [2025-01-09 08:37:27,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:37:27,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:37:27,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:37:27,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:27,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:37:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 08:37:27,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:37:27,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928208179] [2025-01-09 08:37:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928208179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:37:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:37:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:37:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609224533] [2025-01-09 08:37:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:37:27,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:37:27,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:37:27,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:37:27,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:37:27,458 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:37:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:37:27,506 INFO L93 Difference]: Finished difference Result 188 states and 282 transitions. [2025-01-09 08:37:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:37:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-01-09 08:37:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:37:27,508 INFO L225 Difference]: With dead ends: 188 [2025-01-09 08:37:27,508 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 08:37:27,509 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-01-09 08:37:27,509 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 55 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:37:27,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 267 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:37:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 08:37:27,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2025-01-09 08:37:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 71 states have internal predecessors, (89), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 08:37:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2025-01-09 08:37:27,530 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 176 [2025-01-09 08:37:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:37:27,531 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2025-01-09 08:37:27,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:37:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2025-01-09 08:37:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 08:37:27,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:37:27,533 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:37:27,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:37:27,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:37:27,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:37:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1213180158, now seen corresponding path program 1 times [2025-01-09 08:37:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:37:27,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545512504] [2025-01-09 08:37:27,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:27,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:37:27,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:37:27,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:37:27,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:27,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:37:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 08:37:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:37:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545512504] [2025-01-09 08:37:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545512504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:37:27,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:37:27,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:37:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503051614] [2025-01-09 08:37:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:37:27,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:37:27,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:37:27,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:37:27,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:37:27,817 INFO L87 Difference]: Start difference. First operand 113 states and 169 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:37:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:37:27,885 INFO L93 Difference]: Finished difference Result 281 states and 415 transitions. [2025-01-09 08:37:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:37:27,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-01-09 08:37:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:37:27,891 INFO L225 Difference]: With dead ends: 281 [2025-01-09 08:37:27,892 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 08:37:27,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:37:27,893 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 37 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:37:27,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 306 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:37:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 08:37:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2025-01-09 08:37:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 117 states have internal predecessors, (148), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 08:37:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2025-01-09 08:37:27,915 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 176 [2025-01-09 08:37:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:37:27,916 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2025-01-09 08:37:27,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:37:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2025-01-09 08:37:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 08:37:27,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:37:27,929 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:37:27,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:37:27,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:37:27,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:37:27,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1914244736, now seen corresponding path program 1 times [2025-01-09 08:37:27,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:37:27,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927980885] [2025-01-09 08:37:27,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:27,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:37:27,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:37:28,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:37:28,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:28,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:37:28,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [18904610] [2025-01-09 08:37:28,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:28,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:37:28,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:37:28,100 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-01-09 08:37:28,106 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-01-09 08:37:28,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:37:28,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:37:28,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:28,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:37:28,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:37:28,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:37:28,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:37:28,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:28,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:37:28,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:37:28,588 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:37:28,589 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:37:28,600 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-01-09 08:37:28,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:37:28,794 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 08:37:28,879 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:37:28,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:37:28 BoogieIcfgContainer [2025-01-09 08:37:28,881 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:37:28,882 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:37:28,882 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:37:28,883 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:37:28,883 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:37:26" (3/4) ... [2025-01-09 08:37:28,885 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:37:28,885 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:37:28,886 INFO L158 Benchmark]: Toolchain (without parser) took 3225.72ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 53.8MB in the end (delta: 58.9MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2025-01-09 08:37:28,886 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:37:28,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.94ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:37:28,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.32ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:37:28,887 INFO L158 Benchmark]: Boogie Preprocessor took 40.56ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 89.7MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:37:28,887 INFO L158 Benchmark]: RCFGBuilder took 366.87ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 67.1MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:37:28,887 INFO L158 Benchmark]: TraceAbstraction took 2488.46ms. Allocated memory is still 142.6MB. Free memory was 66.6MB in the beginning and 53.8MB in the end (delta: 12.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-01-09 08:37:28,887 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 142.6MB. Free memory was 53.8MB in the beginning and 53.8MB in the end (delta: 12.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:37:28,888 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.67ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.94ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.32ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.56ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 89.7MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 366.87ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 67.1MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2488.46ms. Allocated memory is still 142.6MB. Free memory was 66.6MB in the beginning and 53.8MB in the end (delta: 12.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 142.6MB. Free memory was 53.8MB in the beginning and 53.8MB in the end (delta: 12.7kB). 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 someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned short int var_1_2 = 256; [L24] signed long int var_1_3 = 500; [L25] signed char var_1_4 = 16; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 1; [L28] unsigned short int var_1_7 = 50; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 64; [L33] signed char var_1_12 = -10; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = -25; [L36] double var_1_15 = 64.875; [L37] unsigned long int var_1_16 = 1000000; [L38] double var_1_17 = 1.625; [L39] double var_1_18 = 32.2; [L40] double var_1_19 = 8.6; [L41] double var_1_20 = 10.5; [L42] signed short int var_1_21 = -64; [L43] unsigned char var_1_22 = 25; [L44] unsigned char var_1_23 = 0; [L45] unsigned long int var_1_24 = 5; VAL [isInitial=0, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=256, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L139] isInitial = 1 [L140] FCALL initially() [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L90] var_1_3 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L93] var_1_4 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L99] var_1_6 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L102] var_1_7 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L103] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L105] var_1_9 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1] [L106] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L108] var_1_10 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L109] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L113] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L114] var_1_13 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L115] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L117] var_1_14 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L118] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L119] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L120] var_1_16 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_16 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L122] RET assume_abort_if_not(var_1_16 <= 4294967295) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L124] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L126] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L127] var_1_19 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L129] var_1_20 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L130] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L143] RET updateVariables() [L144] CALL step() [L49] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L49] COND FALSE !((~ var_1_2) != (var_1_3 >> var_1_4)) [L56] var_1_1 = 100 VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L58] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L61] COND TRUE var_1_10 > var_1_8 [L62] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L64] COND FALSE !(var_1_4 > var_1_1) [L67] var_1_15 = var_1_17 VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L69] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L74] COND TRUE ((- var_1_11) < 8) || var_1_9 [L75] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L77] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L78] COND TRUE var_1_18 <= var_1_20 [L79] var_1_24 = ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L135-L136] return (((((((((~ var_1_2) != (var_1_3 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_8) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_8 % var_1_10) > var_1_16) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_23)) : 1)) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=254, var_1_11=319, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 686 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 393 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=3, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1056 NumberOfCodeBlocks, 1056 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 700 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 5994/6048 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-01-09 08:37:28,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.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 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:37:30,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:37:31,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 08:37:31,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:37:31,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:37:31,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:37:31,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:37:31,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:37:31,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:37:31,085 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:37:31,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:37:31,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:37:31,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:37:31,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:37:31,086 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:37:31,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:37:31,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:37:31,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:37:31,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:37:31,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:37:31,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:37:31,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:37:31,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:37:31,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:37:31,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:37:31,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:37:31,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:37:31,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:37:31,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:37:31,090 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 -> 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b [2025-01-09 08:37:31,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:37:31,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:37:31,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:37:31,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:37:31,361 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:37:31,362 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-13.i [2025-01-09 08:37:32,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e166d138/edd03d27c78d4240a82754c09a012cc4/FLAGcfac47faa [2025-01-09 08:37:32,872 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:37:32,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2025-01-09 08:37:32,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e166d138/edd03d27c78d4240a82754c09a012cc4/FLAGcfac47faa [2025-01-09 08:37:33,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e166d138/edd03d27c78d4240a82754c09a012cc4 [2025-01-09 08:37:33,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:37:33,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:37:33,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:37:33,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:37:33,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:37:33,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dca7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33, skipping insertion in model container [2025-01-09 08:37:33,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:37:33,319 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-13.i[913,926] [2025-01-09 08:37:33,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:37:33,384 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:37:33,393 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-13.i[913,926] [2025-01-09 08:37:33,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:37:33,424 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:37:33,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33 WrapperNode [2025-01-09 08:37:33,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:37:33,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:37:33,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:37:33,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:37:33,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,465 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2025-01-09 08:37:33,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:37:33,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:37:33,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:37:33,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:37:33,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,497 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-01-09 08:37:33,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:37:33,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:37:33,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:37:33,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:37:33,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (1/1) ... [2025-01-09 08:37:33,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:37:33,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:37:33,558 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-01-09 08:37:33,568 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-01-09 08:37:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:37:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:37:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:37:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:37:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:37:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:37:33,661 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:37:33,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:37:38,703 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:37:38,703 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:37:38,711 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:37:38,711 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:37:38,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:37:38 BoogieIcfgContainer [2025-01-09 08:37:38,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:37:38,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:37:38,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:37:38,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:37:38,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:37:33" (1/3) ... [2025-01-09 08:37:38,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd25e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:37:38, skipping insertion in model container [2025-01-09 08:37:38,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:37:33" (2/3) ... [2025-01-09 08:37:38,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd25e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:37:38, skipping insertion in model container [2025-01-09 08:37:38,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:37:38" (3/3) ... [2025-01-09 08:37:38,746 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-13.i [2025-01-09 08:37:38,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:37:38,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-13.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:37:38,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:37:38,821 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;@6243bdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:37:38,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:37:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:37:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 08:37:38,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:37:38,836 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:37:38,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:37:38,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:37:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash 737872143, now seen corresponding path program 1 times [2025-01-09 08:37:38,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:37:38,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39669662] [2025-01-09 08:37:38,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:38,851 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-01-09 08:37:38,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:37:38,853 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-01-09 08:37:38,855 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-01-09 08:37:38,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 08:37:39,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 08:37:39,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:39,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:37:39,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:37:39,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:37:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-01-09 08:37:39,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:37:39,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:37:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39669662] [2025-01-09 08:37:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39669662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:37:39,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:37:39,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:37:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548102379] [2025-01-09 08:37:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:37:39,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:37:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:37:39,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:37:39,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:37:39,250 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 08:37:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:37:39,269 INFO L93 Difference]: Finished difference Result 140 states and 247 transitions. [2025-01-09 08:37:39,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:37:39,270 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2025-01-09 08:37:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:37:39,273 INFO L225 Difference]: With dead ends: 140 [2025-01-09 08:37:39,274 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 08:37:39,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-01-09 08:37:39,277 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-01-09 08:37:39,277 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-01-09 08:37:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 08:37:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 08:37:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:37:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-01-09 08:37:39,303 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 173 [2025-01-09 08:37:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:37:39,303 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-01-09 08:37:39,303 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 08:37:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-01-09 08:37:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 08:37:39,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:37:39,305 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:37:39,316 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-01-09 08:37:39,509 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-01-09 08:37:39,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:37:39,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:37:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1902935801, now seen corresponding path program 1 times [2025-01-09 08:37:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:37:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515633681] [2025-01-09 08:37:39,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:39,512 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-01-09 08:37:39,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:37:39,514 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-01-09 08:37:39,516 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-01-09 08:37:39,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 08:37:39,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 08:37:39,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:39,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:37:39,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 08:37:39,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:37:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 428 proven. 132 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2025-01-09 08:37:41,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:37:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 08:37:41,793 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:37:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515633681] [2025-01-09 08:37:41,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515633681] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:37:41,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:37:41,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2025-01-09 08:37:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24609085] [2025-01-09 08:37:41,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:37:41,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:37:41,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:37:41,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:37:41,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:37:41,800 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-01-09 08:37:45,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:37:48,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:37:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:37:49,091 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2025-01-09 08:37:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 08:37:49,092 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 173 [2025-01-09 08:37:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:37:49,095 INFO L225 Difference]: With dead ends: 201 [2025-01-09 08:37:49,096 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 08:37:49,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2025-01-09 08:37:49,098 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 284 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:37:49,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 260 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2025-01-09 08:37:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 08:37:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2025-01-09 08:37:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 66 states have internal predecessors, (82), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 08:37:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2025-01-09 08:37:49,111 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 173 [2025-01-09 08:37:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:37:49,111 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2025-01-09 08:37:49,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-01-09 08:37:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2025-01-09 08:37:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 08:37:49,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:37:49,116 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:37:49,132 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-01-09 08:37:49,316 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-01-09 08:37:49,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:37:49,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:37:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1222877431, now seen corresponding path program 1 times [2025-01-09 08:37:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:37:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955899420] [2025-01-09 08:37:49,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:49,320 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-01-09 08:37:49,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:37:49,325 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-01-09 08:37:49,326 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-01-09 08:37:49,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 08:37:49,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 08:37:49,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:49,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:37:49,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 08:37:49,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:37:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 08:37:49,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:37:49,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:37:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955899420] [2025-01-09 08:37:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955899420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:37:49,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:37:49,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:37:49,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184647016] [2025-01-09 08:37:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:37:49,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:37:49,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:37:49,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:37:49,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:37:49,598 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:37:51,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:37:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:37:51,084 INFO L93 Difference]: Finished difference Result 270 states and 382 transitions. [2025-01-09 08:37:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:37:51,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-01-09 08:37:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:37:51,088 INFO L225 Difference]: With dead ends: 270 [2025-01-09 08:37:51,090 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 08:37:51,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 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-01-09 08:37:51,091 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 51 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:37:51,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 246 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 08:37:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 08:37:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2025-01-09 08:37:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 114 states have internal predecessors, (139), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 08:37:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 235 transitions. [2025-01-09 08:37:51,113 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 235 transitions. Word has length 173 [2025-01-09 08:37:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:37:51,114 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 235 transitions. [2025-01-09 08:37:51,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:37:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 235 transitions. [2025-01-09 08:37:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 08:37:51,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:37:51,116 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:37:51,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 08:37:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 08:37:51,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:37:51,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:37:51,317 INFO L85 PathProgramCache]: Analyzing trace with hash -521812853, now seen corresponding path program 1 times [2025-01-09 08:37:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:37:51,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126189118] [2025-01-09 08:37:51,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:37:51,318 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-01-09 08:37:51,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:37:51,321 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 08:37:51,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 08:37:51,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 08:37:51,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 08:37:51,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:37:51,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:37:51,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 08:37:51,595 INFO L279 TraceCheckSpWp]: Computing forward predicates...