./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e7999cbc02495ec6922b91474a62a692fbfb55ed13055ddc827dcb10c95c728f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:56:01,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:56:01,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:56:01,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:56:01,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:56:01,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:56:01,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:56:01,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:56:01,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:56:01,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:56:01,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:56:01,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:56:01,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:56:01,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:56:01,168 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:56:01,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:56:01,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:56:01,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:56:01,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:56:01,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:56:01,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:56:01,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:56:01,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:56:01,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:56:01,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:56:01,171 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:56:01,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:56:01,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:56:01,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:56:01,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:56:01,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:56:01,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:56:01,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:56:01,171 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> e7999cbc02495ec6922b91474a62a692fbfb55ed13055ddc827dcb10c95c728f [2025-03-08 09:56:01,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:56:01,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:56:01,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:56:01,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:56:01,387 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:56:01,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i [2025-03-08 09:56:02,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f838dcca/eacdcc1aa23c40ab9d2a85196cb0e736/FLAG9accd3ebd [2025-03-08 09:56:02,779 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:56:02,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i [2025-03-08 09:56:02,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f838dcca/eacdcc1aa23c40ab9d2a85196cb0e736/FLAG9accd3ebd [2025-03-08 09:56:02,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f838dcca/eacdcc1aa23c40ab9d2a85196cb0e736 [2025-03-08 09:56:02,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:56:02,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:56:02,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:56:02,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:56:02,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:56:02,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:02" (1/1) ... [2025-03-08 09:56:02,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c97246f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:02, skipping insertion in model container [2025-03-08 09:56:02,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:02" (1/1) ... [2025-03-08 09:56:02,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:56:02,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i[919,932] [2025-03-08 09:56:02,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:56:02,984 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:56:02,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i[919,932] [2025-03-08 09:56:03,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:56:03,017 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:56:03,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03 WrapperNode [2025-03-08 09:56:03,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:56:03,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:56:03,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:56:03,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:56:03,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,050 INFO L138 Inliner]: procedures = 33, calls = 40, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 168 [2025-03-08 09:56:03,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:56:03,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:56:03,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:56:03,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:56:03,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,071 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-03-08 09:56:03,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:56:03,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:56:03,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:56:03,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:56:03,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (1/1) ... [2025-03-08 09:56:03,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:56:03,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:56:03,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:56:03,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:56:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:56:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:56:03,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:56:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:56:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:56:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:56:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure functionized1 [2025-03-08 09:56:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized1 [2025-03-08 09:56:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure functionized0 [2025-03-08 09:56:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized0 [2025-03-08 09:56:03,193 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:56:03,195 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:56:03,432 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-08 09:56:03,432 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:56:03,442 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:56:03,442 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:56:03,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:03 BoogieIcfgContainer [2025-03-08 09:56:03,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:56:03,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:56:03,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:56:03,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:56:03,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:56:02" (1/3) ... [2025-03-08 09:56:03,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a56ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:03, skipping insertion in model container [2025-03-08 09:56:03,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:03" (2/3) ... [2025-03-08 09:56:03,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a56ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:03, skipping insertion in model container [2025-03-08 09:56:03,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:03" (3/3) ... [2025-03-08 09:56:03,449 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-0.i [2025-03-08 09:56:03,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:56:03,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_functionizing_file-0.i that has 4 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:56:03,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:56:03,507 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;@54659b79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:56:03,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:56:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 56 states have internal predecessors, (70), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 09:56:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 09:56:03,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:56:03,522 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:56:03,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:56:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:56:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1142454227, now seen corresponding path program 1 times [2025-03-08 09:56:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:56:03,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142692609] [2025-03-08 09:56:03,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:56:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:56:03,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:56:03,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:56:03,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:56:03,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:56:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 09:56:03,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:56:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142692609] [2025-03-08 09:56:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142692609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:56:03,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403563331] [2025-03-08 09:56:03,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:56:03,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:56:03,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:56:03,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:56:03,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:56:03,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:56:03,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:56:03,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:56:03,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:56:03,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:56:03,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:56:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 09:56:03,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:56:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403563331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:56:03,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:56:03,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 09:56:03,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591548593] [2025-03-08 09:56:03,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:56:03,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:56:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:56:03,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:56:03,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:56:03,958 INFO L87 Difference]: Start difference. First operand has 82 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 56 states have internal predecessors, (70), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 09:56:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:56:03,981 INFO L93 Difference]: Finished difference Result 158 states and 241 transitions. [2025-03-08 09:56:03,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:56:03,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-03-08 09:56:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:56:03,986 INFO L225 Difference]: With dead ends: 158 [2025-03-08 09:56:03,986 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 09:56:03,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-03-08 09:56:03,991 INFO L435 NwaCegarLoop]: 109 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, 109 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-03-08 09:56:03,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:56:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 09:56:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 09:56:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 09:56:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2025-03-08 09:56:04,021 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 131 [2025-03-08 09:56:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:56:04,021 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2025-03-08 09:56:04,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 09:56:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2025-03-08 09:56:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 09:56:04,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:56:04,026 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:56:04,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 09:56:04,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 09:56:04,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:56:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:56:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1455705387, now seen corresponding path program 1 times [2025-03-08 09:56:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:56:04,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691546839] [2025-03-08 09:56:04,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:56:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:56:04,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:56:04,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:56:04,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:56:04,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:56:04,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:56:04,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:56:04,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:56:04,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:56:04,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:56:04,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:56:04,566 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:56:04,567 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:56:04,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:56:04,570 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 09:56:04,647 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:56:04,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:56:04 BoogieIcfgContainer [2025-03-08 09:56:04,654 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:56:04,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:56:04,655 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:56:04,655 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:56:04,655 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:03" (3/4) ... [2025-03-08 09:56:04,659 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:56:04,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:56:04,660 INFO L158 Benchmark]: Toolchain (without parser) took 1844.45ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 103.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2025-03-08 09:56:04,661 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:56:04,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.89ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 90.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:56:04,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.20ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:56:04,661 INFO L158 Benchmark]: Boogie Preprocessor took 31.15ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:56:04,662 INFO L158 Benchmark]: IcfgBuilder took 360.00ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 63.3MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:56:04,662 INFO L158 Benchmark]: TraceAbstraction took 1209.69ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 104.7MB in the end (delta: -42.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-03-08 09:56:04,662 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 103.8MB in the end (delta: 917.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:56:04,663 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.68ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.89ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 90.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.20ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.15ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 360.00ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 63.3MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1209.69ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 104.7MB in the end (delta: -42.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 103.8MB in the end (delta: 917.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L28] unsigned char isInitial = 0; [L29] signed long int var_1_1 = 0; [L30] unsigned char var_1_2 = 0; [L31] unsigned char var_1_3 = 32; [L32] signed long int var_1_4 = -32; [L33] signed long int var_1_5 = 2; [L34] signed short int var_1_6 = -10; [L35] unsigned long int var_1_7 = 1; [L36] unsigned char var_1_8 = 0; [L37] unsigned long int var_1_9 = 3470417420; [L38] unsigned char var_1_10 = 0; [L39] double var_1_11 = 32.875; [L40] double var_1_12 = 25.6; [L41] double var_1_13 = 1.75; [L42] float var_1_14 = 5.4; [L43] float var_1_15 = 127.5; [L44] float var_1_16 = 3.5; [L45] signed long int var_1_17 = 64; [L46] unsigned char var_1_18 = 64; VAL [isInitial=0, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] FCALL updateLastVariables() [L149] CALL updateVariables() [L108] var_1_2 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L109] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L110] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L110] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L111] var_1_3 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L112] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L113] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L113] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L114] var_1_4 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L115] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L116] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L116] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L117] var_1_9 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L118] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L119] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L119] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L120] var_1_10 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L121] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L122] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L122] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L123] var_1_11 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L124] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L125] var_1_12 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L126] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L127] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L127] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L128] var_1_13 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L129] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L130] var_1_15 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L131] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L132] var_1_16 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L133] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L134] var_1_18 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L135] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L136] CALL assume_abort_if_not(var_1_18 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L136] RET assume_abort_if_not(var_1_18 <= 255) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L149] RET updateVariables() [L150] CALL step() [L77] COND TRUE var_1_2 > (- var_1_3) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L78] CALL, EXPR functionized0(var_1_4) VAL [\old(functionized0_localFunctionVar0)=-9, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L48] return (var_1_2 + functionized0_localFunctionVar0); VAL [\old(functionized0_localFunctionVar0)=-9, \result=25, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L78] RET, EXPR functionized0(var_1_4) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L78] EXPR ((var_1_3) > (functionized0(var_1_4))) ? (var_1_3) : (functionized0(var_1_4)) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L78] var_1_1 = ((((var_1_3) > (functionized0(var_1_4))) ? (var_1_3) : (functionized0(var_1_4)))) [L82] CALL functionized2(var_1_4, var_1_3) [L54] COND TRUE functionized2_localFunctionVar1 < var_1_2 [L55] var_1_5 = ((var_1_2 - functionized2_localFunctionVar1) + functionized2_localFunctionVar0) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L82] RET functionized2(var_1_4, var_1_3) [L83] CALL, EXPR functionized3(var_1_5) [L59] return (- functionized3_localFunctionVar0); VAL [\result=8, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L83] RET, EXPR functionized3(var_1_5) [L83] COND FALSE !(var_1_2 < functionized3(var_1_5)) [L86] COND FALSE !(var_1_1 > var_1_3) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L91] CALL functionized5(var_1_11, var_1_2, var_1_13) [L65] COND TRUE (- 8u) >= (var_1_9 - functionized5_localFunctionVar1) [L66] var_1_8 = (! var_1_10) VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=27/5, var_1_17=64, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L91] RET functionized5(var_1_11, var_1_2, var_1_13) [L92] COND FALSE !((var_1_12 * var_1_11) > var_1_13) [L99] var_1_14 = var_1_16 VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=64, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L101] CALL, EXPR functionized6(var_1_13) [L72] return ((((functionized6_localFunctionVar0) < (var_1_16)) ? (functionized6_localFunctionVar0) : (var_1_16))); VAL [\result=3470417425, isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=64, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L101] RET, EXPR functionized6(var_1_13) [L101] COND TRUE ((var_1_11 + var_1_14) / 9.2) < functionized6(var_1_13) [L102] var_1_17 = ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))) VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=34, var_1_18=34, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return (((((((var_1_2 > (- var_1_3)) ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_2 + var_1_4))) ? (var_1_3) : ((var_1_2 + var_1_4)))))) : (var_1_1 == ((signed long int) (((((1 - var_1_2)) < (16)) ? ((1 - var_1_2)) : (16)))))) && ((var_1_3 < var_1_2) ? (var_1_5 == ((signed long int) ((var_1_2 - var_1_3) + var_1_4))) : 1)) && ((var_1_2 < (- var_1_5)) ? (var_1_6 == ((signed short int) (32 - var_1_3))) : 1)) && ((var_1_1 > var_1_3) ? ((var_1_4 <= var_1_6) ? (var_1_7 == ((unsigned long int) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_2)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_11 / var_1_12) >= var_1_13) || var_1_10))))) && (((var_1_12 * var_1_11) > var_1_13) ? ((var_1_9 < var_1_5) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((var_1_11 + var_1_14) / 9.2) < ((((var_1_13) < (var_1_16)) ? (var_1_13) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))))) : (var_1_17 == ((signed long int) var_1_4))) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=34, var_1_18=34, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=34, var_1_18=34, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=34, var_1_18=34, var_1_1=33, var_1_2=34, var_1_3=-223, var_1_4=-9, var_1_5=-8, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-141733920776] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 82 locations, 136 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 109 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 323 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 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-03-08 09:56:04,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e7999cbc02495ec6922b91474a62a692fbfb55ed13055ddc827dcb10c95c728f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:56:06,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:56:06,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:56:06,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:56:06,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:56:06,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:56:06,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:56:06,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:56:06,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:56:06,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:56:06,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:56:06,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:56:06,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:56:06,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:56:06,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:56:06,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:56:06,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:56:06,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:56:06,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:56:06,589 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/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 -> e7999cbc02495ec6922b91474a62a692fbfb55ed13055ddc827dcb10c95c728f [2025-03-08 09:56:06,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:56:06,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:56:06,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:56:06,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:56:06,834 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:56:06,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i [2025-03-08 09:56:07,984 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fceb149/1e70f9adb919423ca77f751f5c6068d1/FLAGb36446b44 [2025-03-08 09:56:08,218 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:56:08,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i [2025-03-08 09:56:08,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fceb149/1e70f9adb919423ca77f751f5c6068d1/FLAGb36446b44 [2025-03-08 09:56:08,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fceb149/1e70f9adb919423ca77f751f5c6068d1 [2025-03-08 09:56:08,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:56:08,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:56:08,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:56:08,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:56:08,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:56:08,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a9be0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08, skipping insertion in model container [2025-03-08 09:56:08,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:56:08,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i[919,932] [2025-03-08 09:56:08,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:56:08,732 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:56:08,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i[919,932] [2025-03-08 09:56:08,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:56:08,778 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:56:08,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08 WrapperNode [2025-03-08 09:56:08,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:56:08,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:56:08,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:56:08,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:56:08,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,816 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 161 [2025-03-08 09:56:08,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:56:08,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:56:08,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:56:08,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:56:08,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,838 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-03-08 09:56:08,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,847 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:56:08,852 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:56:08,852 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:56:08,852 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:56:08,853 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (1/1) ... [2025-03-08 09:56:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:56:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:56:08,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:56:08,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:56:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:56:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:56:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:56:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:56:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:56:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:56:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure functionized1 [2025-03-08 09:56:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized1 [2025-03-08 09:56:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure functionized0 [2025-03-08 09:56:08,905 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized0 [2025-03-08 09:56:08,978 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:56:08,979 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:56:32,696 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-08 09:56:32,697 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:56:32,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:56:32,703 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:56:32,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:32 BoogieIcfgContainer [2025-03-08 09:56:32,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:56:32,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:56:32,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:56:32,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:56:32,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:56:08" (1/3) ... [2025-03-08 09:56:32,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456b79d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:32, skipping insertion in model container [2025-03-08 09:56:32,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:08" (2/3) ... [2025-03-08 09:56:32,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456b79d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:32, skipping insertion in model container [2025-03-08 09:56:32,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:32" (3/3) ... [2025-03-08 09:56:32,714 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-0.i [2025-03-08 09:56:32,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:56:32,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_functionizing_file-0.i that has 4 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:56:32,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:56:32,762 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;@5d9656d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:56:32,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:56:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 54 states have internal predecessors, (68), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 09:56:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 09:56:32,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:56:32,772 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:56:32,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:56:32,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:56:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1965249543, now seen corresponding path program 1 times [2025-03-08 09:56:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:56:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155709544] [2025-03-08 09:56:32,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:56:32,783 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-03-08 09:56:32,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:56:32,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-08 09:56:32,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 09:56:32,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 09:56:34,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 09:56:34,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:56:34,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:56:34,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:56:34,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:56:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-08 09:56:34,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:56:34,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:56:34,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155709544] [2025-03-08 09:56:34,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155709544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:56:34,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:56:34,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:56:34,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511849067] [2025-03-08 09:56:34,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:56:34,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:56:34,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:56:34,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:56:34,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:56:34,378 INFO L87 Difference]: Start difference. First operand has 80 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 54 states have internal predecessors, (68), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 09:56:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:56:34,397 INFO L93 Difference]: Finished difference Result 154 states and 237 transitions. [2025-03-08 09:56:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:56:34,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 130 [2025-03-08 09:56:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:56:34,402 INFO L225 Difference]: With dead ends: 154 [2025-03-08 09:56:34,402 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 09:56:34,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-03-08 09:56:34,406 INFO L435 NwaCegarLoop]: 107 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, 107 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-03-08 09:56:34,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:56:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 09:56:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-08 09:56:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 09:56:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2025-03-08 09:56:34,433 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 130 [2025-03-08 09:56:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:56:34,433 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2025-03-08 09:56:34,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 09:56:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2025-03-08 09:56:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 09:56:34,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:56:34,435 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:56:34,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 09:56:34,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-08 09:56:34,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:56:34,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:56:34,636 INFO L85 PathProgramCache]: Analyzing trace with hash -218869957, now seen corresponding path program 1 times [2025-03-08 09:56:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:56:34,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195836802] [2025-03-08 09:56:34,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:56:34,638 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-03-08 09:56:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:56:34,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-08 09:56:34,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 09:56:34,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 09:56:37,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 09:56:37,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:56:37,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:56:37,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 09:56:37,289 INFO L279 TraceCheckSpWp]: Computing forward predicates...