./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-77.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-77.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 61edaa17b57a1e296f8c551a6e15613c70d27e9bd710209c47f2d0643bc678c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:46:13,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:46:13,931 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:46:13,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:46:13,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:46:13,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:46:13,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:46:13,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:46:13,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:46:13,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:46:13,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:46:13,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:46:13,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:46:13,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:46:13,972 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:46:13,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:46:13,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:46:13,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:46:13,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:46:13,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:46:13,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:46:13,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:46:13,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:46:13,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:46:13,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:46:13,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:46:13,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:46:13,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:46:13,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:46:13,974 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:46:13,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:46:13,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:46:13,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:46:13,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:46:13,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:46:13,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:46:13,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:46:13,975 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 -> 61edaa17b57a1e296f8c551a6e15613c70d27e9bd710209c47f2d0643bc678c5 [2025-01-09 08:46:14,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:46:14,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:46:14,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:46:14,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:46:14,295 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:46:14,296 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-77.i [2025-01-09 08:46:15,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b7ecfd6a/9020ddd5168f4ccc87430ef8f48a37b3/FLAGff3945472 [2025-01-09 08:46:15,804 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:46:15,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-77.i [2025-01-09 08:46:15,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b7ecfd6a/9020ddd5168f4ccc87430ef8f48a37b3/FLAGff3945472 [2025-01-09 08:46:15,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b7ecfd6a/9020ddd5168f4ccc87430ef8f48a37b3 [2025-01-09 08:46:15,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:46:15,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:46:15,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:46:15,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:46:15,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:46:15,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:46:15" (1/1) ... [2025-01-09 08:46:15,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5126683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:15, skipping insertion in model container [2025-01-09 08:46:15,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:46:15" (1/1) ... [2025-01-09 08:46:15,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:46:16,000 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-77.i[913,926] [2025-01-09 08:46:16,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:46:16,087 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:46:16,097 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-77.i[913,926] [2025-01-09 08:46:16,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:46:16,147 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:46:16,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16 WrapperNode [2025-01-09 08:46:16,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:46:16,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:46:16,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:46:16,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:46:16,157 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:46:16" (1/1) ... [2025-01-09 08:46:16,165 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:46:16" (1/1) ... [2025-01-09 08:46:16,204 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-01-09 08:46:16,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:46:16,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:46:16,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:46:16,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:46:16,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,231 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:46:16,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:46:16,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:46:16,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:46:16,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:46:16,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (1/1) ... [2025-01-09 08:46:16,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:46:16,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:46:16,288 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:46:16,292 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:46:16,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:46:16,311 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:46:16,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:46:16,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:46:16,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:46:16,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:46:16,370 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:46:16,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:46:16,670 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:46:16,670 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:46:16,683 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:46:16,683 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:46:16,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:46:16 BoogieIcfgContainer [2025-01-09 08:46:16,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:46:16,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:46:16,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:46:16,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:46:16,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:46:15" (1/3) ... [2025-01-09 08:46:16,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20db082f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:46:16, skipping insertion in model container [2025-01-09 08:46:16,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:16" (2/3) ... [2025-01-09 08:46:16,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20db082f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:46:16, skipping insertion in model container [2025-01-09 08:46:16,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:46:16" (3/3) ... [2025-01-09 08:46:16,695 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-77.i [2025-01-09 08:46:16,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:46:16,712 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-77.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:46:16,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:46:16,784 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;@3099a84b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:46:16,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:46:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 08:46:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 08:46:16,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:46:16,804 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:16,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:46:16,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:46:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash -769544468, now seen corresponding path program 1 times [2025-01-09 08:46:16,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:46:16,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171641609] [2025-01-09 08:46:16,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:46:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:46:16,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:46:16,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:46:16,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:46:16,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:46:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 08:46:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:46:17,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171641609] [2025-01-09 08:46:17,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171641609] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:46:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44556822] [2025-01-09 08:46:17,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:46:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:46:17,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:46:17,133 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:46:17,136 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:46:17,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:46:17,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:46:17,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:46:17,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:46:17,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:46:17,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:46:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 08:46:17,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:46:17,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44556822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:46:17,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:46:17,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:46:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817186956] [2025-01-09 08:46:17,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:46:17,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:46:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:46:17,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:46:17,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:46:17,350 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 08:46:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:46:17,378 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2025-01-09 08:46:17,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:46:17,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-01-09 08:46:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:46:17,388 INFO L225 Difference]: With dead ends: 124 [2025-01-09 08:46:17,388 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 08:46:17,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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:46:17,395 INFO L435 NwaCegarLoop]: 94 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, 94 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:46:17,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:46:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 08:46:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 08:46:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 08:46:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2025-01-09 08:46:17,451 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 144 [2025-01-09 08:46:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:46:17,453 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2025-01-09 08:46:17,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 08:46:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2025-01-09 08:46:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 08:46:17,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:46:17,461 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:17,470 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:46:17,666 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:46:17,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:46:17,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:46:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash 547801842, now seen corresponding path program 1 times [2025-01-09 08:46:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:46:17,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154508417] [2025-01-09 08:46:17,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:46:17,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:46:17,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:46:17,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:46:17,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:46:17,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:46:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590001247] [2025-01-09 08:46:17,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:46:17,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:46:17,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:46:17,936 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:46:17,945 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:46:18,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:46:18,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:46:18,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:46:18,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:46:18,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 08:46:18,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:46:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 750 proven. 72 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 08:46:20,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:46:25,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ 10050 (* c_~var_1_12~0 65535) c_~var_1_11~0) 65536))) (let ((.cse3 (mod c_~var_1_17~0 65536)) (.cse1 (mod c_~var_1_11~0 65536)) (.cse2 (+ 1 .cse4))) (let ((.cse5 (< (div .cse3 .cse1) .cse2)) (.cse0 (< 0 (+ c_~var_1_4~0 1))) (.cse7 (forall ((~var_1_5~0 Int)) (or (= (mod ~var_1_5~0 .cse1) 0) (< 0 (+ ~var_1_5~0 1)) (< (div ~var_1_5~0 .cse1) .cse4))))) (and (or .cse0 (and (forall ((~var_1_5~0 Int)) (or (< (div ~var_1_5~0 .cse1) .cse2) (< .cse3 (+ ~var_1_5~0 1)) (< 0 (+ c_~var_1_4~0 ~var_1_5~0 1)))) (or (and (<= 0 (+ c_~var_1_4~0 .cse3)) (forall ((~var_1_5~0 Int)) (or (< ~var_1_5~0 .cse3) (< (div ~var_1_5~0 .cse1) .cse4) (< 0 (+ c_~var_1_4~0 ~var_1_5~0 1)))) (forall ((~var_1_5~0 Int)) (or (< (div ~var_1_5~0 .cse1) .cse2) (< 0 (+ c_~var_1_4~0 ~var_1_5~0 1))))) .cse5))) (or (< c_~var_1_4~0 0) (and (or (and (forall ((~var_1_5~0 Int)) (or (< ~var_1_5~0 .cse3) (< c_~var_1_4~0 (+ ~var_1_5~0 1)) (< (div ~var_1_5~0 .cse1) .cse4))) (forall ((~var_1_5~0 Int)) (or (< c_~var_1_4~0 (+ ~var_1_5~0 1)) (< (div ~var_1_5~0 .cse1) .cse2))) (<= c_~var_1_4~0 .cse3)) .cse5) (forall ((~var_1_5~0 Int)) (let ((.cse6 (+ ~var_1_5~0 1))) (or (< c_~var_1_4~0 .cse6) (< (div ~var_1_5~0 .cse1) .cse2) (< .cse3 .cse6)))) .cse7)) (forall ((~var_1_5~0 Int)) (or (< c_~var_1_4~0 (+ ~var_1_5~0 1)) (< (div ~var_1_5~0 .cse1) .cse2) (< 0 (+ c_~var_1_4~0 ~var_1_5~0 1)))) (or .cse0 .cse7) (forall ((~var_1_5~0 Int)) (or (= (mod ~var_1_5~0 .cse1) 0) (< c_~var_1_4~0 (+ ~var_1_5~0 1)) (< (div ~var_1_5~0 .cse1) .cse4) (< 0 (+ c_~var_1_4~0 ~var_1_5~0 1)))))))) is different from false [2025-01-09 08:46:30,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ 10050 (* c_~var_1_12~0 65535) c_~var_1_11~0) 65536))) (let ((.cse5 (mod c_~var_1_17~0 65536)) (.cse0 (mod c_~var_1_11~0 65536)) (.cse1 (+ 1 .cse4))) (let ((.cse2 (< 0 (+ c_~var_1_4~0 1))) (.cse6 (< (div .cse5 .cse0) .cse1)) (.cse3 (forall ((~var_1_5~0 Int)) (or (= (mod ~var_1_5~0 .cse0) 0) (< 0 (+ ~var_1_5~0 1)) (< (div ~var_1_5~0 .cse0) .cse4))))) (and (forall ((~var_1_5~0 Int)) (or (< c_~var_1_4~0 (+ ~var_1_5~0 1)) (< (div ~var_1_5~0 .cse0) .cse1) (< 0 (+ c_~var_1_4~0 ~var_1_5~0 1)))) (or .cse2 .cse3) (forall ((~var_1_5~0 Int)) (or (= (mod ~var_1_5~0 .cse0) 0) (< c_~var_1_4~0 (+ ~var_1_5~0 1)) (< (div ~var_1_5~0 .cse0) .cse4) (< 0 (+ c_~var_1_4~0 ~var_1_5~0 1)))) (or .cse2 (and (or (and (<= 0 (+ c_~var_1_4~0 .cse5)) (forall ((~var_1_5~0 Int)) (or (< (div ~var_1_5~0 .cse0) .cse1) (< 0 (+ c_~var_1_4~0 ~var_1_5~0 1))))) .cse6) (forall ((~var_1_5~0 Int)) (or (< (div ~var_1_5~0 .cse0) .cse1) (< .cse5 (+ ~var_1_5~0 1)) (< 0 (+ c_~var_1_4~0 ~var_1_5~0 1)))))) (or (< c_~var_1_4~0 0) (and (or (and (forall ((~var_1_5~0 Int)) (or (< c_~var_1_4~0 (+ ~var_1_5~0 1)) (< (div ~var_1_5~0 .cse0) .cse1))) (<= c_~var_1_4~0 .cse5)) .cse6) (forall ((~var_1_5~0 Int)) (let ((.cse7 (+ ~var_1_5~0 1))) (or (< c_~var_1_4~0 .cse7) (< (div ~var_1_5~0 .cse0) .cse1) (< .cse5 .cse7)))) .cse3)))))) is different from false [2025-01-09 08:46:30,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:46:30,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154508417] [2025-01-09 08:46:30,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 08:46:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590001247] [2025-01-09 08:46:30,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590001247] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:46:30,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:46:30,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-01-09 08:46:30,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171767313] [2025-01-09 08:46:30,889 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 08:46:30,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 08:46:30,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:46:30,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 08:46:30,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=347, Unknown=2, NotChecked=82, Total=552 [2025-01-09 08:46:30,893 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 18 states have internal predecessors, (59), 7 states have call successors, (23), 7 states have call predecessors, (23), 10 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2025-01-09 08:46:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:46:33,133 INFO L93 Difference]: Finished difference Result 198 states and 271 transitions. [2025-01-09 08:46:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 08:46:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 18 states have internal predecessors, (59), 7 states have call successors, (23), 7 states have call predecessors, (23), 10 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 144 [2025-01-09 08:46:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:46:33,137 INFO L225 Difference]: With dead ends: 198 [2025-01-09 08:46:33,137 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 08:46:33,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=364, Invalid=832, Unknown=2, NotChecked=134, Total=1332 [2025-01-09 08:46:33,139 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 199 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:46:33,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 276 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 08:46:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 08:46:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2025-01-09 08:46:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 08:46:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 143 transitions. [2025-01-09 08:46:33,166 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 143 transitions. Word has length 144 [2025-01-09 08:46:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:46:33,167 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 143 transitions. [2025-01-09 08:46:33,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 18 states have internal predecessors, (59), 7 states have call successors, (23), 7 states have call predecessors, (23), 10 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2025-01-09 08:46:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2025-01-09 08:46:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 08:46:33,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:46:33,169 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:33,176 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:46:33,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:46:33,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:46:33,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:46:33,373 INFO L85 PathProgramCache]: Analyzing trace with hash 549648884, now seen corresponding path program 1 times [2025-01-09 08:46:33,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:46:33,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983264661] [2025-01-09 08:46:33,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:46:33,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:46:33,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:46:33,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:46:33,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:46:33,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:46:33,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404306693] [2025-01-09 08:46:33,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:46:33,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:46:33,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:46:33,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:46:33,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:46:33,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:46:33,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:46:33,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:46:33,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:46:33,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:46:33,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:46:33,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:46:33,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:46:33,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:46:33,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:46:33,874 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:46:33,875 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:46:33,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 08:46:34,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:46:34,081 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 08:46:34,162 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:46:34,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:46:34 BoogieIcfgContainer [2025-01-09 08:46:34,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:46:34,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:46:34,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:46:34,167 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:46:34,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:46:16" (3/4) ... [2025-01-09 08:46:34,169 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:46:34,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:46:34,171 INFO L158 Benchmark]: Toolchain (without parser) took 18340.24ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 110.4MB in the beginning and 238.7MB in the end (delta: -128.3MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2025-01-09 08:46:34,171 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:46:34,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.64ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 96.7MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:46:34,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.71ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:46:34,172 INFO L158 Benchmark]: Boogie Preprocessor took 48.76ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 89.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:46:34,173 INFO L158 Benchmark]: RCFGBuilder took 430.99ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 69.5MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 08:46:34,173 INFO L158 Benchmark]: TraceAbstraction took 17479.06ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 68.5MB in the beginning and 238.8MB in the end (delta: -170.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:46:34,174 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 302.0MB. Free memory was 238.8MB in the beginning and 238.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:46:34,175 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.64ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 96.7MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.71ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.76ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 89.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 430.99ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 69.5MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17479.06ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 68.5MB in the beginning and 238.8MB in the end (delta: -170.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 302.0MB. Free memory was 238.8MB in the beginning and 238.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] signed long int var_1_5 = -16; [L27] float var_1_6 = 255.25; [L28] unsigned short int var_1_7 = 16; [L29] signed char var_1_8 = -10; [L30] signed char var_1_9 = -8; [L31] unsigned short int var_1_10 = 8; [L32] unsigned short int var_1_11 = 10000; [L33] unsigned short int var_1_12 = 5; [L34] signed short int var_1_13 = 200; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_15 = 0; [L37] unsigned short int var_1_16 = 35895; [L38] unsigned short int var_1_17 = 18336; [L39] unsigned char var_1_18 = 0; [L40] signed long int var_1_19 = -50; VAL [isInitial=0, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_2=511/2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L130] isInitial = 1 [L131] FCALL initially() [L133] FCALL updateLastVariables() [L134] CALL updateVariables() [L86] var_1_2 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L87] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L88] var_1_3 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L89] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L90] var_1_4 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L91] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L92] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L92] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L93] var_1_5 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L94] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L95] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L95] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L96] var_1_6 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=16, var_1_8=-10, var_1_9=-8] [L97] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=16, var_1_8=-10, var_1_9=-8] [L98] var_1_7 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_8=-10, var_1_9=-8] [L99] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_8=-10, var_1_9=-8] [L100] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-8] [L100] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-8] [L101] var_1_9 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L102] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L103] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L103] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L104] var_1_11 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L105] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L106] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L106] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L107] var_1_12 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L108] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L109] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L109] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L110] var_1_14 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L111] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L112] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L112] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L113] var_1_16 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L114] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L115] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L115] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L116] var_1_17 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L117] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L118] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L118] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L121] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L121] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L134] RET updateVariables() [L135] CALL step() [L44] COND FALSE !(((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= var_1_5) [L51] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L53] COND FALSE !((- var_1_7) < (var_1_5 * var_1_4)) VAL [isInitial=1, var_1_10=8, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L56] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) VAL [isInitial=1, var_1_10=1858, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L57] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, var_1_10=1858, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L64] COND FALSE !(var_1_3 != var_1_6) [L71] var_1_15 = var_1_18 VAL [isInitial=1, var_1_10=1858, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L73] COND FALSE !(var_1_10 < (- var_1_5)) VAL [isInitial=1, var_1_10=1858, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L78] COND FALSE !(var_1_10 < (((((var_1_5) < (var_1_17)) ? (var_1_5) : (var_1_17))) / var_1_11)) [L81] var_1_19 = var_1_16 VAL [isInitial=1, var_1_10=1858, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=32767, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L135] RET step() [L136] CALL, EXPR property() [L126-L127] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= var_1_5) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_5 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (var_1_14 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_1 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_10 < (- var_1_5)) ? (((var_1_7 + (128 + var_1_10)) <= var_1_8) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_10 < (((((var_1_5) < (var_1_17)) ? (var_1_5) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; VAL [\result=0, isInitial=1, var_1_10=1858, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=32767, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1858, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=32767, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] [L19] reach_error() VAL [isInitial=1, var_1_10=1858, var_1_11=8191, var_1_12=81919, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=32767, var_1_1=0, var_1_4=-127, var_1_5=126, var_1_7=0, var_1_8=-10, var_1_9=-9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 370 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 159 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=2, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 2604 SizeOfPredicates, 6 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2920/3036 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:46:34,388 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-09 08:46:34,425 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 137 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-77.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 61edaa17b57a1e296f8c551a6e15613c70d27e9bd710209c47f2d0643bc678c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:46:36,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:46:36,700 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:46:36,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:46:36,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:46:36,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:46:36,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:46:36,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:46:36,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:46:36,741 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:46:36,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:46:36,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:46:36,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:46:36,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:46:36,742 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:46:36,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:46:36,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:46:36,743 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:46:36,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:46:36,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:46:36,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:46:36,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:46:36,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:46:36,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:46:36,744 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:46:36,744 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:46:36,744 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:46:36,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:46:36,744 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:46:36,744 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:46:36,744 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:46:36,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:46:36,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:46:36,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:46:36,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:46:36,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:46:36,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:46:36,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:46:36,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:46:36,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:46:36,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:46:36,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:46:36,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:46:36,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:46:36,746 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:46:36,746 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:46:36,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:46:36,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:46:36,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:46:36,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:46:36,747 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 -> 61edaa17b57a1e296f8c551a6e15613c70d27e9bd710209c47f2d0643bc678c5 [2025-01-09 08:46:37,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:46:37,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:46:37,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:46:37,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:46:37,078 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:46:37,079 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-77.i [2025-01-09 08:46:38,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc779c956/e12bf9deda2048e6b438a22b846972e9/FLAG1261e78fa [2025-01-09 08:46:38,714 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:46:38,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-77.i [2025-01-09 08:46:38,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc779c956/e12bf9deda2048e6b438a22b846972e9/FLAG1261e78fa [2025-01-09 08:46:39,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc779c956/e12bf9deda2048e6b438a22b846972e9 [2025-01-09 08:46:39,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:46:39,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:46:39,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:46:39,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:46:39,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:46:39,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2a1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39, skipping insertion in model container [2025-01-09 08:46:39,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:46:39,244 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-77.i[913,926] [2025-01-09 08:46:39,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:46:39,329 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:46:39,340 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-77.i[913,926] [2025-01-09 08:46:39,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:46:39,400 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:46:39,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39 WrapperNode [2025-01-09 08:46:39,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:46:39,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:46:39,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:46:39,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:46:39,408 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:46:39" (1/1) ... [2025-01-09 08:46:39,418 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:46:39" (1/1) ... [2025-01-09 08:46:39,440 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2025-01-09 08:46:39,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:46:39,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:46:39,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:46:39,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:46:39,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,466 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:46:39,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,475 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:46:39,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:46:39,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:46:39,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:46:39,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (1/1) ... [2025-01-09 08:46:39,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:46:39,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:46:39,522 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:46:39,525 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:46:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:46:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:46:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:46:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:46:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:46:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:46:39,635 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:46:39,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:46:40,828 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:46:40,828 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:46:40,838 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:46:40,838 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:46:40,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:46:40 BoogieIcfgContainer [2025-01-09 08:46:40,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:46:40,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:46:40,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:46:40,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:46:40,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:46:39" (1/3) ... [2025-01-09 08:46:40,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f85e7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:46:40, skipping insertion in model container [2025-01-09 08:46:40,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:39" (2/3) ... [2025-01-09 08:46:40,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f85e7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:46:40, skipping insertion in model container [2025-01-09 08:46:40,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:46:40" (3/3) ... [2025-01-09 08:46:40,850 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-77.i [2025-01-09 08:46:40,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:46:40,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-77.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:46:40,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:46:40,931 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;@757d577c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:46:40,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:46:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 08:46:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 08:46:40,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:46:40,946 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:40,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:46:40,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:46:40,950 INFO L85 PathProgramCache]: Analyzing trace with hash -769544468, now seen corresponding path program 1 times [2025-01-09 08:46:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:46:40,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374761887] [2025-01-09 08:46:40,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:46:40,960 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:46:40,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:46:40,963 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:46:40,964 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:46:41,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:46:41,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:46:41,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:46:41,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:46:41,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:46:41,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:46:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2025-01-09 08:46:41,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:46:41,345 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:46:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374761887] [2025-01-09 08:46:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374761887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:46:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:46:41,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:46:41,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738457448] [2025-01-09 08:46:41,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:46:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:46:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:46:41,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:46:41,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:46:41,376 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 08:46:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:46:41,403 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2025-01-09 08:46:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:46:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-01-09 08:46:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:46:41,413 INFO L225 Difference]: With dead ends: 124 [2025-01-09 08:46:41,414 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 08:46:41,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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:46:41,423 INFO L435 NwaCegarLoop]: 93 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, 93 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:46:41,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:46:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 08:46:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 08:46:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 08:46:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2025-01-09 08:46:41,465 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 144 [2025-01-09 08:46:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:46:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2025-01-09 08:46:41,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 08:46:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2025-01-09 08:46:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 08:46:41,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:46:41,469 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:41,478 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:46:41,674 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:46:41,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:46:41,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:46:41,675 INFO L85 PathProgramCache]: Analyzing trace with hash 547801842, now seen corresponding path program 1 times [2025-01-09 08:46:41,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:46:41,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256262217] [2025-01-09 08:46:41,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:46:41,676 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:46:41,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:46:41,678 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:46:41,682 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:46:41,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:46:41,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:46:41,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:46:41,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:46:41,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 08:46:41,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:47:12,139 WARN L286 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)