./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:05:23,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:05:23,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:05:23,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:05:23,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:05:23,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:05:23,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:05:23,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:05:23,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:05:23,400 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:05:23,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:05:23,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:05:23,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:05:23,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:05:23,402 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:05:23,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:05:23,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:05:23,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:05:23,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:05:23,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:05:23,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:05:23,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:05:23,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:05:23,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:05:23,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:05:23,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:05:23,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:05:23,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:05:23,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:05:23,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:05:23,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:05:23,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:05:23,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:05:23,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:05:23,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:05:23,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:05:23,405 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf [2025-01-09 15:05:23,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:05:23,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:05:23,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:05:23,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:05:23,718 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:05:23,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i [2025-01-09 15:05:25,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc37c5937/f91eb1013732473e9339e719eaa10c57/FLAG344ca7096 [2025-01-09 15:05:25,283 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:05:25,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i [2025-01-09 15:05:25,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc37c5937/f91eb1013732473e9339e719eaa10c57/FLAG344ca7096 [2025-01-09 15:05:25,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc37c5937/f91eb1013732473e9339e719eaa10c57 [2025-01-09 15:05:25,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:05:25,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:05:25,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:05:25,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:05:25,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:05:25,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad399b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25, skipping insertion in model container [2025-01-09 15:05:25,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:05:25,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i[913,926] [2025-01-09 15:05:25,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:05:25,768 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:05:25,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i[913,926] [2025-01-09 15:05:25,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:05:25,809 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:05:25,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25 WrapperNode [2025-01-09 15:05:25,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:05:25,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:05:25,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:05:25,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:05:25,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,853 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-01-09 15:05:25,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:05:25,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:05:25,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:05:25,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:05:25,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,896 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:05:25,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:05:25,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:05:25,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:05:25,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:05:25,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (1/1) ... [2025-01-09 15:05:25,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:05:25,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:05:25,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:05:25,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:05:25,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:05:25,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:05:25,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:05:25,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:05:25,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:05:25,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:05:26,059 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:05:26,061 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:05:26,310 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 15:05:26,310 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:05:26,321 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:05:26,321 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:05:26,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:26 BoogieIcfgContainer [2025-01-09 15:05:26,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:05:26,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:05:26,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:05:26,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:05:26,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:05:25" (1/3) ... [2025-01-09 15:05:26,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f80e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:05:26, skipping insertion in model container [2025-01-09 15:05:26,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:25" (2/3) ... [2025-01-09 15:05:26,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f80e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:05:26, skipping insertion in model container [2025-01-09 15:05:26,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:26" (3/3) ... [2025-01-09 15:05:26,332 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-10.i [2025-01-09 15:05:26,346 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:05:26,347 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-10.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:05:26,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:05:26,410 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;@58aaa213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:05:26,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:05:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:05:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:05:26,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:05:26,425 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:05:26,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:05:26,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:05:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2036165382, now seen corresponding path program 1 times [2025-01-09 15:05:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:05:26,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087389215] [2025-01-09 15:05:26,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:05:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:05:26,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:05:26,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:05:26,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:05:26,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:05:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:05:26,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:05:26,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087389215] [2025-01-09 15:05:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087389215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:05:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891645856] [2025-01-09 15:05:26,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:05:26,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:05:26,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:05:26,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:05:26,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:05:26,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:05:26,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:05:26,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:05:26,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:05:26,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:05:26,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:05:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:05:26,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:05:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891645856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:05:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:05:26,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:05:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463155722] [2025-01-09 15:05:26,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:05:26,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:05:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:05:26,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:05:26,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:05:26,903 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-01-09 15:05:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:05:26,922 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2025-01-09 15:05:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:05:26,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 119 [2025-01-09 15:05:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:05:26,929 INFO L225 Difference]: With dead ends: 100 [2025-01-09 15:05:26,929 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 15:05:26,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:05:26,933 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:05:26,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:05:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 15:05:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 15:05:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:05:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-01-09 15:05:26,979 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 119 [2025-01-09 15:05:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:05:26,979 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-01-09 15:05:26,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-01-09 15:05:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-01-09 15:05:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:05:26,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:05:26,982 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:05:26,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:05:27,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:05:27,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:05:27,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:05:27,184 INFO L85 PathProgramCache]: Analyzing trace with hash -138377600, now seen corresponding path program 1 times [2025-01-09 15:05:27,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:05:27,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614829073] [2025-01-09 15:05:27,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:05:27,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:05:27,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:05:27,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:05:27,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:05:27,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:05:27,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:05:27,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:05:27,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:05:27,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:05:27,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:05:27,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:05:27,509 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:05:27,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:05:27,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:05:27,514 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 15:05:27,605 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:05:27,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:05:27 BoogieIcfgContainer [2025-01-09 15:05:27,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:05:27,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:05:27,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:05:27,610 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:05:27,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:26" (3/4) ... [2025-01-09 15:05:27,613 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:05:27,614 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:05:27,614 INFO L158 Benchmark]: Toolchain (without parser) took 2028.94ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 75.7MB in the end (delta: 36.0MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2025-01-09 15:05:27,615 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:05:27,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.51ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:05:27,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.03ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:05:27,616 INFO L158 Benchmark]: Boogie Preprocessor took 64.32ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:05:27,617 INFO L158 Benchmark]: RCFGBuilder took 399.73ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 78.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:05:27,617 INFO L158 Benchmark]: TraceAbstraction took 1284.47ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 75.8MB in the end (delta: 2.2MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2025-01-09 15:05:27,617 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 75.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:05:27,619 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.26ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.51ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.03ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.32ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 399.73ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 78.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1284.47ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 75.8MB in the end (delta: 2.2MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 75.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someUnaryDOUBLEoperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 8; [L24] double var_1_3 = 9.15; [L25] double var_1_6 = 1000000.875; [L26] double var_1_7 = 49.25; [L27] double var_1_8 = -0.8; [L28] signed char var_1_9 = -10; [L29] unsigned short int var_1_10 = 58996; [L30] unsigned short int var_1_11 = 32; [L31] signed char var_1_12 = 32; [L32] signed char var_1_13 = 16; [L33] signed char var_1_14 = 2; [L34] signed long int var_1_15 = 32; [L35] signed long int var_1_17 = 1000000000; [L36] float var_1_18 = -0.5; [L37] signed char var_1_19 = 2; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L40] double last_1_var_1_3 = 9.15; VAL [isInitial=0, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=8, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L110] isInitial = 1 [L111] FCALL initially() [L113] CALL updateLastVariables() [L103] last_1_var_1_3 = var_1_3 VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=8, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L73] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L73] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L74] var_1_6 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_7=197/4, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_7=197/4, var_1_9=-10] [L75] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_7=197/4, var_1_9=-10] [L76] var_1_7 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L77] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L78] var_1_8 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L79] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L80] var_1_10 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L81] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L82] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L82] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L83] var_1_11 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L85] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L85] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L86] var_1_12 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L87] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L88] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L88] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L89] var_1_13 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L91] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L91] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L92] var_1_14 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L94] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L94] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L95] var_1_17 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_17 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L96] RET assume_abort_if_not(var_1_17 >= 536870911) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L97] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L97] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L98] var_1_21 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_21 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L99] RET assume_abort_if_not(var_1_21 >= 1) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L100] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L100] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_9=-10] [L114] RET updateVariables() [L115] CALL step() [L44] var_1_1 = var_1_2 [L45] var_1_18 = var_1_8 [L46] var_1_19 = var_1_12 [L47] var_1_20 = var_1_21 [L48] signed char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_3=183/20, stepLocal_1=0, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_18=1073741828, var_1_19=0, var_1_1=-2, var_1_20=-255, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_8=1073741828, var_1_9=-10] [L49] COND TRUE (- (var_1_10 - var_1_11)) >= stepLocal_1 [L50] var_1_9 = (var_1_12 - ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1073741823, var_1_18=1073741828, var_1_19=0, var_1_1=-2, var_1_20=-255, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_8=1073741828, var_1_9=-1] [L54] COND TRUE \read(var_1_20) [L55] var_1_15 = (var_1_12 - var_1_14) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=1073741823, var_1_18=1073741828, var_1_19=0, var_1_1=-2, var_1_20=-255, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_8=1073741828, var_1_9=-1] [L59] signed long int stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_3=183/20, stepLocal_0=0, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=1073741823, var_1_18=1073741828, var_1_19=0, var_1_1=-2, var_1_20=-255, var_1_21=-255, var_1_2=-2, var_1_3=183/20, var_1_8=1073741828, var_1_9=-1] [L60] COND TRUE stepLocal_0 < var_1_1 [L61] var_1_3 = -0.5 VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=1073741823, var_1_18=1073741828, var_1_19=0, var_1_1=-2, var_1_20=-255, var_1_21=-255, var_1_2=-2, var_1_8=1073741828, var_1_9=-1] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((((var_1_1 == ((unsigned long int) var_1_2)) && ((var_1_15 < var_1_1) ? (var_1_3 == ((double) -0.5)) : (((- last_1_var_1_3) == (var_1_6 - var_1_7)) ? (var_1_3 == ((double) var_1_8)) : (var_1_3 == ((double) var_1_8))))) && (((- (var_1_10 - var_1_11)) >= var_1_19) ? (var_1_9 == ((signed char) (var_1_12 - ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14)))))) : (var_1_9 == ((signed char) ((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))))))) && (var_1_20 ? (var_1_15 == ((signed long int) (var_1_12 - var_1_14))) : (var_1_15 == ((signed long int) (var_1_13 - ((var_1_17 - 4) + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) && (var_1_18 == ((float) var_1_8))) && (var_1_19 == ((signed char) var_1_12))) && (var_1_20 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=1073741823, var_1_18=1073741828, var_1_19=0, var_1_1=-2, var_1_20=-255, var_1_21=-255, var_1_2=-2, var_1_8=1073741828, var_1_9=-1] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=1073741823, var_1_18=1073741828, var_1_19=0, var_1_1=-2, var_1_20=-255, var_1_21=-255, var_1_2=-2, var_1_8=1073741828, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=1073741823, var_1_18=1073741828, var_1_19=0, var_1_1=-2, var_1_20=-255, var_1_21=-255, var_1_2=-2, var_1_8=1073741828, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 72 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, 72 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:05:27,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:05:29,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:05:29,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:05:29,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:05:29,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:05:29,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:05:29,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:05:29,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:05:29,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:05:29,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:05:29,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:05:29,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:05:29,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:05:29,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:05:29,905 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:05:29,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:05:29,906 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:05:29,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:05:29,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:05:29,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:05:29,911 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:05:29,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:05:29,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:05:29,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:05:29,916 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:05:29,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:05:29,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:05:29,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:05:29,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:05:29,917 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf [2025-01-09 15:05:30,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:05:30,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:05:30,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:05:30,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:05:30,174 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:05:30,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i [2025-01-09 15:05:31,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7c78fe0a/95f01354389f4fa8aea9d46475998d00/FLAG8a9c54587 [2025-01-09 15:05:31,730 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:05:31,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i [2025-01-09 15:05:31,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7c78fe0a/95f01354389f4fa8aea9d46475998d00/FLAG8a9c54587 [2025-01-09 15:05:31,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7c78fe0a/95f01354389f4fa8aea9d46475998d00 [2025-01-09 15:05:31,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:05:31,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:05:31,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:05:31,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:05:31,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:05:31,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:05:31" (1/1) ... [2025-01-09 15:05:31,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db211eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:31, skipping insertion in model container [2025-01-09 15:05:31,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:05:31" (1/1) ... [2025-01-09 15:05:31,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:05:31,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i[913,926] [2025-01-09 15:05:31,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:05:31,988 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:05:31,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i[913,926] [2025-01-09 15:05:32,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:05:32,042 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:05:32,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32 WrapperNode [2025-01-09 15:05:32,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:05:32,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:05:32,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:05:32,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:05:32,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,084 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-01-09 15:05:32,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:05:32,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:05:32,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:05:32,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:05:32,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,105 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:05:32,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:05:32,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:05:32,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:05:32,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:05:32,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (1/1) ... [2025-01-09 15:05:32,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:05:32,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:05:32,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:05:32,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:05:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:05:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:05:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:05:32,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:05:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:05:32,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:05:32,271 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:05:32,273 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:05:33,099 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 15:05:33,099 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:05:33,109 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:05:33,110 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:05:33,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:33 BoogieIcfgContainer [2025-01-09 15:05:33,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:05:33,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:05:33,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:05:33,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:05:33,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:05:31" (1/3) ... [2025-01-09 15:05:33,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159ef5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:05:33, skipping insertion in model container [2025-01-09 15:05:33,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:32" (2/3) ... [2025-01-09 15:05:33,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159ef5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:05:33, skipping insertion in model container [2025-01-09 15:05:33,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:33" (3/3) ... [2025-01-09 15:05:33,121 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-10.i [2025-01-09 15:05:33,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:05:33,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-10.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:05:33,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:05:33,193 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;@3d3a54e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:05:33,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:05:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:05:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:05:33,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:05:33,208 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:05:33,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:05:33,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:05:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2036165382, now seen corresponding path program 1 times [2025-01-09 15:05:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:05:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706519852] [2025-01-09 15:05:33,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:05:33,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:05:33,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:05:33,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:05:33,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:05:33,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:05:33,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:05:33,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:05:33,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:05:33,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:05:33,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:05:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:05:33,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:05:33,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:05:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706519852] [2025-01-09 15:05:33,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706519852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:05:33,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:05:33,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:05:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972622166] [2025-01-09 15:05:33,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:05:33,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:05:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:05:33,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:05:33,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:05:33,545 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:05:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:05:33,565 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2025-01-09 15:05:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:05:33,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 15:05:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:05:33,574 INFO L225 Difference]: With dead ends: 100 [2025-01-09 15:05:33,574 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 15:05:33,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:05:33,578 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:05:33,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:05:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 15:05:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 15:05:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:05:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-01-09 15:05:33,618 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 119 [2025-01-09 15:05:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:05:33,618 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-01-09 15:05:33,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:05:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-01-09 15:05:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:05:33,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:05:33,623 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:05:33,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:05:33,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:05:33,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:05:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:05:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash -138377600, now seen corresponding path program 1 times [2025-01-09 15:05:33,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:05:33,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711478217] [2025-01-09 15:05:33,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:05:33,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:05:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:05:33,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:05:33,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:05:33,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:05:34,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:05:34,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:05:34,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:05:34,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 15:05:34,038 INFO L279 TraceCheckSpWp]: Computing forward predicates...