./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.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_operatoramount_amount50_file-48.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 45a08fcee4ca717bf2d75cca462db1a8e3270cd7b26ded37876e062399a1dff7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:58:23,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:58:23,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:58:23,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:58:23,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:58:23,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:58:23,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:58:23,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:58:23,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:58:23,841 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:58:23,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:58:23,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:58:23,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:58:23,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:58:23,841 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:58:23,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:58:23,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:58:23,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:58:23,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:58:23,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:58:23,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:58:23,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:58:23,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:23,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:58:23,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:58:23,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:58:23,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:58:23,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:23,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:58:23,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:58:23,845 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:58:23,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:58:23,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:58:23,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:58:23,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:58:23,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:58:23,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:58:23,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:58:23,846 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 -> 45a08fcee4ca717bf2d75cca462db1a8e3270cd7b26ded37876e062399a1dff7 [2025-01-09 14:58:24,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:58:24,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:58:24,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:58:24,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:58:24,167 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:58:24,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i [2025-01-09 14:58:25,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/894215393/b840c5c56bf94a05b1504e4e3717747c/FLAGcde755ac7 [2025-01-09 14:58:25,812 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:58:25,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i [2025-01-09 14:58:25,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/894215393/b840c5c56bf94a05b1504e4e3717747c/FLAGcde755ac7 [2025-01-09 14:58:25,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/894215393/b840c5c56bf94a05b1504e4e3717747c [2025-01-09 14:58:25,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:58:25,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:58:25,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:58:25,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:58:25,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:58:25,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:25" (1/1) ... [2025-01-09 14:58:25,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206a4507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:25, skipping insertion in model container [2025-01-09 14:58:25,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:25" (1/1) ... [2025-01-09 14:58:25,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:58:26,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i[915,928] [2025-01-09 14:58:26,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:58:26,153 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:58:26,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i[915,928] [2025-01-09 14:58:26,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:58:26,225 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:58:26,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26 WrapperNode [2025-01-09 14:58:26,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:58:26,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:58:26,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:58:26,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:58:26,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,289 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-01-09 14:58:26,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:58:26,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:58:26,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:58:26,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:58:26,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,332 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 14:58:26,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:58:26,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:58:26,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:58:26,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:58:26,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 14:58:26,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:26,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:58:26,399 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 14:58:26,403 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 14:58:26,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:58:26,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:58:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:58:26,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:58:26,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:58:26,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:58:26,496 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:58:26,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:58:26,825 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:58:26,825 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:58:26,837 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:58:26,838 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:58:26,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:26 BoogieIcfgContainer [2025-01-09 14:58:26,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:58:26,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:58:26,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:58:26,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:58:26,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:58:25" (1/3) ... [2025-01-09 14:58:26,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f46c057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:26, skipping insertion in model container [2025-01-09 14:58:26,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (2/3) ... [2025-01-09 14:58:26,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f46c057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:26, skipping insertion in model container [2025-01-09 14:58:26,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:26" (3/3) ... [2025-01-09 14:58:26,849 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-48.i [2025-01-09 14:58:26,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:58:26,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-48.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:58:26,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:58:26,940 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;@1535441b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:58:26,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:58:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 14:58:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 14:58:26,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:26,957 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:26,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:26,964 INFO L85 PathProgramCache]: Analyzing trace with hash 396664723, now seen corresponding path program 1 times [2025-01-09 14:58:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:58:26,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127575947] [2025-01-09 14:58:26,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:58:27,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 14:58:27,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 14:58:27,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:27,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 14:58:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:58:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127575947] [2025-01-09 14:58:27,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127575947] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:58:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454536819] [2025-01-09 14:58:27,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:27,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:58:27,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:58:27,271 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 14:58:27,272 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 14:58:27,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 14:58:27,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 14:58:27,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:27,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:27,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:58:27,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:58:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 14:58:27,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:58:27,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454536819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:58:27,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:58:27,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:58:27,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543202869] [2025-01-09 14:58:27,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:58:27,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:58:27,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:58:27,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:58:27,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:58:27,487 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 14:58:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:58:27,517 INFO L93 Difference]: Finished difference Result 121 states and 207 transitions. [2025-01-09 14:58:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:58:27,519 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-01-09 14:58:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:58:27,525 INFO L225 Difference]: With dead ends: 121 [2025-01-09 14:58:27,525 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 14:58:27,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 14:58:27,533 INFO L435 NwaCegarLoop]: 89 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, 89 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 14:58:27,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:58:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 14:58:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 14:58:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 14:58:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2025-01-09 14:58:27,583 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2025-01-09 14:58:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:58:27,584 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2025-01-09 14:58:27,585 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 14:58:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2025-01-09 14:58:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 14:58:27,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:27,589 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:27,600 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 14:58:27,795 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 14:58:27,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:27,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash 817605275, now seen corresponding path program 1 times [2025-01-09 14:58:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:58:27,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796410677] [2025-01-09 14:58:27,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:58:27,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 14:58:27,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 14:58:27,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:27,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:58:28,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:58:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796410677] [2025-01-09 14:58:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796410677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:58:28,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:58:28,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:58:28,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312946926] [2025-01-09 14:58:28,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:58:28,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:58:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:58:28,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:58:28,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:58:28,196 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:58:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:58:28,244 INFO L93 Difference]: Finished difference Result 174 states and 261 transitions. [2025-01-09 14:58:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:58:28,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-01-09 14:58:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:58:28,248 INFO L225 Difference]: With dead ends: 174 [2025-01-09 14:58:28,248 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 14:58:28,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:58:28,249 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 42 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:58:28,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 172 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:58:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 14:58:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-01-09 14:58:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 14:58:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2025-01-09 14:58:28,282 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 129 [2025-01-09 14:58:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:58:28,284 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2025-01-09 14:58:28,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:58:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2025-01-09 14:58:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 14:58:28,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:28,287 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:28,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:58:28,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:28,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash 760346973, now seen corresponding path program 1 times [2025-01-09 14:58:28,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:58:28,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925976216] [2025-01-09 14:58:28,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:28,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:58:28,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 14:58:28,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 14:58:28,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:28,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:58:28,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:58:28,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925976216] [2025-01-09 14:58:28,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925976216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:58:28,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:58:28,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:58:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575608277] [2025-01-09 14:58:28,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:58:28,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:58:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:58:28,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:58:28,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:58:28,439 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:58:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:58:28,482 INFO L93 Difference]: Finished difference Result 254 states and 381 transitions. [2025-01-09 14:58:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:58:28,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-01-09 14:58:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:58:28,487 INFO L225 Difference]: With dead ends: 254 [2025-01-09 14:58:28,490 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 14:58:28,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:58:28,492 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:58:28,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 169 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:58:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 14:58:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2025-01-09 14:58:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 14:58:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2025-01-09 14:58:28,521 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 129 [2025-01-09 14:58:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:58:28,521 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2025-01-09 14:58:28,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:58:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2025-01-09 14:58:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 14:58:28,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:28,526 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:28,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:58:28,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:28,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash -368691395, now seen corresponding path program 1 times [2025-01-09 14:58:28,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:58:28,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290579891] [2025-01-09 14:58:28,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:28,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:58:28,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 14:58:28,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 14:58:28,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:28,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:58:28,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:58:28,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 14:58:28,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 14:58:28,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:28,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:58:28,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:58:28,821 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:58:28,822 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:58:28,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:58:28,826 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 14:58:28,934 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:58:28,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:58:28 BoogieIcfgContainer [2025-01-09 14:58:28,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:58:28,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:58:28,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:58:28,938 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:58:28,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:26" (3/4) ... [2025-01-09 14:58:28,941 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:58:28,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:58:28,943 INFO L158 Benchmark]: Toolchain (without parser) took 3054.32ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 61.5MB in the end (delta: 51.4MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2025-01-09 14:58:28,943 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:58:28,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.13ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:58:28,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.18ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.4MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:58:28,944 INFO L158 Benchmark]: Boogie Preprocessor took 72.98ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 91.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:58:28,945 INFO L158 Benchmark]: RCFGBuilder took 472.22ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 71.2MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 14:58:28,946 INFO L158 Benchmark]: TraceAbstraction took 2095.03ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 61.5MB in the end (delta: 9.2MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2025-01-09 14:58:28,946 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 61.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:58:28,948 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.30ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.13ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.18ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.4MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.98ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 91.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 472.22ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 71.2MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2095.03ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 61.5MB in the end (delta: 9.2MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 61.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned char last_1_var_1_8 = 5; [L41] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L141] isInitial = 1 [L142] FCALL initially() [L144] CALL updateLastVariables() [L133] last_1_var_1_8 = var_1_8 [L134] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L144] RET updateLastVariables() [L145] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] var_1_3 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] var_1_4 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] var_1_5 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] var_1_6 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L109] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L110] var_1_7 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L112] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L112] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L113] var_1_9 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L114] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L115] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L115] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L118] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L118] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L119] var_1_11 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L120] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L121] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L121] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L122] var_1_15 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L123] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L124] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L124] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L125] var_1_16 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L126] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L127] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L127] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L128] var_1_17 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L129] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L130] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L130] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L145] RET updateVariables() [L146] CALL step() [L45] COND FALSE !(\read(var_1_2)) [L54] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L56] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_1=65, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L57] COND TRUE var_1_10 == stepLocal_1 [L58] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L62] COND FALSE !(\read(var_1_2)) [L69] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=5] [L71] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=5] [L72] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L73] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L81] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L84] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L87] COND FALSE !(last_1_var_1_18 != var_1_16) [L94] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=65, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=65, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=65, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=65, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 430 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 271 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 646 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3002/3040 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 14:58:28,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.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 45a08fcee4ca717bf2d75cca462db1a8e3270cd7b26ded37876e062399a1dff7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:58:31,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:58:31,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:58:31,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:58:31,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:58:31,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:58:31,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:58:31,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:58:31,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:58:31,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:58:31,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:58:31,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:58:31,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:58:31,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:58:31,363 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:58:31,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:58:31,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:58:31,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:58:31,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:58:31,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:58:31,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:58:31,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:58:31,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:58:31,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:58:31,365 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:58:31,365 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:58:31,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:58:31,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:58:31,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:58:31,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:58:31,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:58:31,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:58:31,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:58:31,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:58:31,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:31,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:58:31,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:58:31,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:58:31,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:58:31,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:31,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:58:31,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:58:31,368 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:58:31,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:58:31,368 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:58:31,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:58:31,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:58:31,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:58:31,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:58:31,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:58:31,369 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 -> 45a08fcee4ca717bf2d75cca462db1a8e3270cd7b26ded37876e062399a1dff7 [2025-01-09 14:58:31,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:58:31,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:58:31,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:58:31,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:58:31,661 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:58:31,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i [2025-01-09 14:58:32,890 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e49d72ec0/757cf94825ee4620ae13653042dabac7/FLAG32f1b7262 [2025-01-09 14:58:33,182 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:58:33,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i [2025-01-09 14:58:33,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e49d72ec0/757cf94825ee4620ae13653042dabac7/FLAG32f1b7262 [2025-01-09 14:58:33,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e49d72ec0/757cf94825ee4620ae13653042dabac7 [2025-01-09 14:58:33,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:58:33,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:58:33,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:58:33,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:58:33,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:58:33,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffda342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33, skipping insertion in model container [2025-01-09 14:58:33,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:58:33,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i[915,928] [2025-01-09 14:58:33,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:58:33,711 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:58:33,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i[915,928] [2025-01-09 14:58:33,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:58:33,766 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:58:33,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33 WrapperNode [2025-01-09 14:58:33,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:58:33,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:58:33,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:58:33,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:58:33,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,814 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-01-09 14:58:33,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:58:33,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:58:33,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:58:33,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:58:33,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,857 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 14:58:33,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:58:33,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:58:33,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:58:33,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:58:33,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (1/1) ... [2025-01-09 14:58:33,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:33,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:58:33,935 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 14:58:33,939 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 14:58:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:58:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:58:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:58:33,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:58:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:58:33,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:58:34,058 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:58:34,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:59:01,306 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:59:01,306 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:59:01,318 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:59:01,319 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:59:01,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:59:01 BoogieIcfgContainer [2025-01-09 14:59:01,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:59:01,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:59:01,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:59:01,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:59:01,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:58:33" (1/3) ... [2025-01-09 14:59:01,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de100a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:59:01, skipping insertion in model container [2025-01-09 14:59:01,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:33" (2/3) ... [2025-01-09 14:59:01,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de100a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:59:01, skipping insertion in model container [2025-01-09 14:59:01,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:59:01" (3/3) ... [2025-01-09 14:59:01,328 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-48.i [2025-01-09 14:59:01,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:59:01,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-48.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:59:01,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:59:01,414 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;@50c722c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:59:01,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:59:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 14:59:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 14:59:01,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:59:01,430 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:01,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:59:01,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:59:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash 396664723, now seen corresponding path program 1 times [2025-01-09 14:59:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:59:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535780095] [2025-01-09 14:59:01,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:59:01,449 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 14:59:01,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:59:01,453 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 14:59:01,454 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 14:59:01,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 14:59:02,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 14:59:02,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:59:02,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:59:02,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:59:02,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:59:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2025-01-09 14:59:03,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:59:03,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:59:03,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535780095] [2025-01-09 14:59:03,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535780095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:59:03,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:59:03,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:59:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807341740] [2025-01-09 14:59:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:59:03,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:59:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:59:03,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:59:03,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:59:03,043 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 14:59:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:59:03,068 INFO L93 Difference]: Finished difference Result 121 states and 207 transitions. [2025-01-09 14:59:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:59:03,072 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-01-09 14:59:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:59:03,078 INFO L225 Difference]: With dead ends: 121 [2025-01-09 14:59:03,080 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 14:59:03,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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 14:59:03,087 INFO L435 NwaCegarLoop]: 89 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, 89 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 14:59:03,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:59:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 14:59:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 14:59:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 14:59:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2025-01-09 14:59:03,137 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2025-01-09 14:59:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:59:03,139 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2025-01-09 14:59:03,139 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 14:59:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2025-01-09 14:59:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 14:59:03,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:59:03,144 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:03,195 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 14:59:03,345 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 14:59:03,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:59:03,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:59:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash 817605275, now seen corresponding path program 1 times [2025-01-09 14:59:03,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:59:03,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705180747] [2025-01-09 14:59:03,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:59:03,347 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 14:59:03,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:59:03,350 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 14:59:03,351 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 14:59:03,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 14:59:04,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 14:59:04,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:59:04,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:59:04,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:59:04,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:59:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:59:09,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:59:09,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:59:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705180747] [2025-01-09 14:59:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705180747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:59:09,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:59:09,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:59:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270103389] [2025-01-09 14:59:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:59:09,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:59:09,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:59:09,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:59:09,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:59:09,218 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:59:13,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:59:17,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:59:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:59:17,896 INFO L93 Difference]: Finished difference Result 174 states and 261 transitions. [2025-01-09 14:59:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:59:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-01-09 14:59:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:59:17,900 INFO L225 Difference]: With dead ends: 174 [2025-01-09 14:59:17,900 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 14:59:17,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:59:17,901 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:59:17,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 172 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 14:59:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 14:59:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-01-09 14:59:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 14:59:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2025-01-09 14:59:17,923 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 129 [2025-01-09 14:59:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:59:17,924 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2025-01-09 14:59:17,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:59:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2025-01-09 14:59:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 14:59:17,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:59:17,926 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:17,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 14:59:18,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:59:18,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:59:18,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:59:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 760346973, now seen corresponding path program 1 times [2025-01-09 14:59:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:59:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870079580] [2025-01-09 14:59:18,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:59:18,128 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 14:59:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:59:18,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:59:18,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 14:59:18,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 14:59:19,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 14:59:19,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:59:19,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:59:19,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:59:19,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:59:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:59:19,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:59:19,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:59:19,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870079580] [2025-01-09 14:59:19,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870079580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:59:19,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:59:19,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:59:19,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687329450] [2025-01-09 14:59:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:59:19,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:59:19,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:59:19,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:59:19,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:59:19,660 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:59:24,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:59:28,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:59:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:59:28,439 INFO L93 Difference]: Finished difference Result 254 states and 381 transitions. [2025-01-09 14:59:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:59:28,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-01-09 14:59:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:59:28,442 INFO L225 Difference]: With dead ends: 254 [2025-01-09 14:59:28,442 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 14:59:28,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:59:28,444 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:59:28,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 169 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2025-01-09 14:59:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 14:59:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2025-01-09 14:59:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 14:59:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2025-01-09 14:59:28,462 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 129 [2025-01-09 14:59:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:59:28,462 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2025-01-09 14:59:28,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:59:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2025-01-09 14:59:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 14:59:28,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:59:28,464 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:28,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 14:59:28,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:59:28,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:59:28,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:59:28,666 INFO L85 PathProgramCache]: Analyzing trace with hash -368691395, now seen corresponding path program 1 times [2025-01-09 14:59:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:59:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470609068] [2025-01-09 14:59:28,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:59:28,666 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 14:59:28,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:59:28,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:59:28,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 14:59:28,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 14:59:29,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 14:59:29,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:59:29,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:59:30,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:59:30,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:59:46,965 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:59:55,447 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)