./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.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_loopvsstraightlinecode_25-1loop_file-62.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 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:20:06,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:20:06,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:20:06,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:20:06,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:20:06,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:20:06,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:20:06,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:20:06,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:20:06,131 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:20:06,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:20:06,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:20:06,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:20:06,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:20:06,131 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:20:06,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:20:06,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:20:06,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:20:06,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:20:06,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:20:06,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:20:06,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:20:06,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:20:06,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:20:06,133 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:20:06,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:20:06,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:20:06,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:20:06,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:20:06,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:20:06,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:20:06,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:20:06,134 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 -> 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f [2025-01-09 13:20:06,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:20:06,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:20:06,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:20:06,343 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:20:06,343 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:20:06,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-01-09 13:20:07,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4744727ae/9c281a66e6b945d080bbb7c539caf0a9/FLAG442c03040 [2025-01-09 13:20:07,714 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:20:07,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-01-09 13:20:07,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4744727ae/9c281a66e6b945d080bbb7c539caf0a9/FLAG442c03040 [2025-01-09 13:20:07,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4744727ae/9c281a66e6b945d080bbb7c539caf0a9 [2025-01-09 13:20:07,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:20:07,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:20:07,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:20:07,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:20:07,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:20:07,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:07,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d98222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07, skipping insertion in model container [2025-01-09 13:20:07,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:07,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:20:07,874 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_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2025-01-09 13:20:07,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:20:07,916 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:20:07,923 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_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2025-01-09 13:20:07,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:20:07,955 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:20:07,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07 WrapperNode [2025-01-09 13:20:07,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:20:07,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:20:07,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:20:07,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:20:07,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:07,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:07,987 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-01-09 13:20:07,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:20:07,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:20:07,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:20:07,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:20:07,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:07,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,008 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:20:08,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:20:08,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:20:08,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:20:08,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:20:08,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (1/1) ... [2025-01-09 13:20:08,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:20:08,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:20:08,045 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 13:20:08,047 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 13:20:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:20:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:20:08,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:20:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:20:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:20:08,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:20:08,114 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:20:08,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:20:08,248 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:20:08,248 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:20:08,258 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:20:08,258 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:20:08,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:20:08 BoogieIcfgContainer [2025-01-09 13:20:08,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:20:08,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:20:08,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:20:08,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:20:08,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:20:07" (1/3) ... [2025-01-09 13:20:08,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3ce345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:20:08, skipping insertion in model container [2025-01-09 13:20:08,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:07" (2/3) ... [2025-01-09 13:20:08,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3ce345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:20:08, skipping insertion in model container [2025-01-09 13:20:08,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:20:08" (3/3) ... [2025-01-09 13:20:08,268 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-01-09 13:20:08,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:20:08,280 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:20:08,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:20:08,339 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;@369820c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:20:08,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:20:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:20:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 13:20:08,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:08,347 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:20:08,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:08,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1496157900, now seen corresponding path program 1 times [2025-01-09 13:20:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:20:08,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25830663] [2025-01-09 13:20:08,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:08,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:20:08,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 13:20:08,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 13:20:08,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:08,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 13:20:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:20:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25830663] [2025-01-09 13:20:08,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25830663] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:20:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044682096] [2025-01-09 13:20:08,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:08,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:20:08,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:20:08,519 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 13:20:08,520 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 13:20:08,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 13:20:08,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 13:20:08,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:08,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:08,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:20:08,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 13:20:08,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:20:08,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044682096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:20:08,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:20:08,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:20:08,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049663971] [2025-01-09 13:20:08,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:20:08,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:20:08,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:20:08,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:20:08,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:20:08,664 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:20:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:20:08,676 INFO L93 Difference]: Finished difference Result 87 states and 139 transitions. [2025-01-09 13:20:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:20:08,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2025-01-09 13:20:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:20:08,681 INFO L225 Difference]: With dead ends: 87 [2025-01-09 13:20:08,681 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 13:20:08,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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 13:20:08,685 INFO L435 NwaCegarLoop]: 62 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, 62 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 13:20:08,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:20:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 13:20:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 13:20:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:20:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-01-09 13:20:08,708 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 91 [2025-01-09 13:20:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:20:08,708 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-01-09 13:20:08,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:20:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2025-01-09 13:20:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 13:20:08,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:08,711 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:20:08,717 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 13:20:08,915 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 13:20:08,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:08,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1512676628, now seen corresponding path program 1 times [2025-01-09 13:20:08,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:20:08,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982304712] [2025-01-09 13:20:08,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:20:08,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 13:20:09,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 13:20:09,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:09,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:20:09,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:20:09,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 13:20:09,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 13:20:09,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:09,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:20:09,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:20:09,091 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:20:09,091 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:20:09,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:20:09,095 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:20:09,144 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:20:09,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:20:09 BoogieIcfgContainer [2025-01-09 13:20:09,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:20:09,149 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:20:09,149 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:20:09,149 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:20:09,150 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:20:08" (3/4) ... [2025-01-09 13:20:09,152 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:20:09,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:20:09,154 INFO L158 Benchmark]: Toolchain (without parser) took 1405.49ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 98.9MB in the end (delta: 14.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-01-09 13:20:09,154 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:09,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.43ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:20:09,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.74ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:20:09,156 INFO L158 Benchmark]: Boogie Preprocessor took 28.14ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:09,156 INFO L158 Benchmark]: RCFGBuilder took 239.23ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 83.4MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:20:09,156 INFO L158 Benchmark]: TraceAbstraction took 887.75ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 98.9MB in the end (delta: -16.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:09,156 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 98.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:09,157 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.43ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.74ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.14ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 239.23ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 83.4MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 887.75ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 98.9MB in the end (delta: -16.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 98.9MB 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 53, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = -128; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -5; [L26] unsigned char var_1_5 = 16; [L27] unsigned char var_1_9 = 25; [L28] float var_1_10 = 2.5; [L29] signed char var_1_11 = 1; [L30] signed char var_1_12 = 4; [L31] float var_1_13 = 7.75; [L32] float var_1_14 = 64.75; [L33] float var_1_15 = 256.52; [L34] float var_1_16 = 3.25; VAL [isInitial=0, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L91] isInitial = 1 [L92] FCALL initially() [L93] int k_loop; [L94] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L94] COND TRUE k_loop < 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L63] var_1_4 = __VERIFIER_nondet_char() [L64] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=25] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L69] var_1_11 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L70] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L71] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L74] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L76] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L78] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L96] RET updateVariables() [L97] CALL step() [L38] var_1_1 = (16 - 2) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_1=14, var_1_2=-128, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L39] COND TRUE \read(var_1_3) [L40] var_1_2 = ((((-4) < 0 ) ? -(-4) : (-4))) VAL [isInitial=1, var_1_10=5/2, var_1_11=63, var_1_12=79, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L44] COND FALSE !(var_1_4 < ((16 + var_1_11) - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=261, var_1_11=63, var_1_12=79, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=0, var_1_5=16, var_1_9=0] [L53] COND TRUE (var_1_10 * var_1_10) > var_1_10 [L54] var_1_5 = (((((25) < (5)) ? (25) : (5))) + 10) VAL [isInitial=1, var_1_10=261, var_1_11=63, var_1_12=79, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=0, var_1_5=15, var_1_9=0] [L97] RET step() [L98] CALL, EXPR property() [L87-L88] return (((var_1_1 == ((signed char) (16 - 2))) && (var_1_3 ? (var_1_2 == ((signed char) ((((-4) < 0 ) ? -(-4) : (-4))))) : (var_1_2 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (((var_1_10 * var_1_10) > var_1_10) ? (var_1_5 == ((unsigned char) (((((25) < (5)) ? (25) : (5))) + 10))) : (var_1_5 == ((unsigned char) var_1_9)))) && ((var_1_4 < ((16 + var_1_11) - var_1_12)) ? (var_1_3 ? (var_1_10 == ((float) ((var_1_13 + 50.6f) + var_1_14))) : (var_1_10 == ((float) (var_1_15 - var_1_16)))) : (var_1_10 == ((float) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=261, var_1_11=63, var_1_12=79, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=0, var_1_5=15, var_1_9=0] [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=261, var_1_11=63, var_1_12=79, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=0, var_1_5=15, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=261, var_1_11=63, var_1_12=79, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=0, var_1_5=15, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 14, 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, 62 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, 62 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 216 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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 13:20:09,178 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_loopvsstraightlinecode_25-1loop_file-62.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 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:20:11,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:20:11,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:20:11,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:20:11,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:20:11,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:20:11,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:20:11,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:20:11,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:20:11,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:20:11,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:20:11,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:20:11,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:20:11,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:20:11,176 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:20:11,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:20:11,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:20:11,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:20:11,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:20:11,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:20:11,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:20:11,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:20:11,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:20:11,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:20:11,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:20:11,183 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 -> 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f [2025-01-09 13:20:11,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:20:11,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:20:11,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:20:11,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:20:11,426 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:20:11,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-01-09 13:20:12,637 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39d08cab1/edcd78cb7f6a49afb6ebce2eea79fac8/FLAGd12584f82 [2025-01-09 13:20:12,812 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:20:12,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-01-09 13:20:12,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39d08cab1/edcd78cb7f6a49afb6ebce2eea79fac8/FLAGd12584f82 [2025-01-09 13:20:12,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39d08cab1/edcd78cb7f6a49afb6ebce2eea79fac8 [2025-01-09 13:20:12,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:20:12,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:20:12,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:20:12,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:20:12,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:20:12,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:20:12" (1/1) ... [2025-01-09 13:20:12,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdb5e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:12, skipping insertion in model container [2025-01-09 13:20:12,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:20:12" (1/1) ... [2025-01-09 13:20:12,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:20:12,975 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_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2025-01-09 13:20:13,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:20:13,038 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:20:13,046 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_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2025-01-09 13:20:13,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:20:13,084 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:20:13,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13 WrapperNode [2025-01-09 13:20:13,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:20:13,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:20:13,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:20:13,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:20:13,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,125 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-01-09 13:20:13,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:20:13,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:20:13,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:20:13,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:20:13,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,151 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 13:20:13,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:20:13,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:20:13,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:20:13,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:20:13,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (1/1) ... [2025-01-09 13:20:13,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:20:13,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:20:13,212 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 13:20:13,214 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 13:20:13,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:20:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:20:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:20:13,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:20:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:20:13,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:20:13,278 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:20:13,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:20:14,444 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:20:14,445 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:20:14,450 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:20:14,451 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:20:14,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:20:14 BoogieIcfgContainer [2025-01-09 13:20:14,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:20:14,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:20:14,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:20:14,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:20:14,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:20:12" (1/3) ... [2025-01-09 13:20:14,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2028d48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:20:14, skipping insertion in model container [2025-01-09 13:20:14,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:13" (2/3) ... [2025-01-09 13:20:14,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2028d48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:20:14, skipping insertion in model container [2025-01-09 13:20:14,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:20:14" (3/3) ... [2025-01-09 13:20:14,457 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-01-09 13:20:14,467 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:20:14,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:20:14,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:20:14,518 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;@2fa5f2de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:20:14,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:20:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:20:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 13:20:14,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:14,526 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:20:14,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:14,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1496157900, now seen corresponding path program 1 times [2025-01-09 13:20:14,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:20:14,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983340932] [2025-01-09 13:20:14,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:14,536 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 13:20:14,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:20:14,539 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 13:20:14,542 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 13:20:14,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 13:20:14,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 13:20:14,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:14,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:14,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:20:14,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-01-09 13:20:14,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:20:14,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:20:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983340932] [2025-01-09 13:20:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983340932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:20:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:20:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:20:14,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429422745] [2025-01-09 13:20:14,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:20:14,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:20:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:20:14,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:20:14,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:20:14,817 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:20:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:20:14,836 INFO L93 Difference]: Finished difference Result 87 states and 139 transitions. [2025-01-09 13:20:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:20:14,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2025-01-09 13:20:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:20:14,843 INFO L225 Difference]: With dead ends: 87 [2025-01-09 13:20:14,844 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 13:20:14,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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 13:20:14,851 INFO L435 NwaCegarLoop]: 62 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, 62 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 13:20:14,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:20:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 13:20:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 13:20:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:20:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-01-09 13:20:14,885 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 91 [2025-01-09 13:20:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:20:14,886 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-01-09 13:20:14,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:20:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2025-01-09 13:20:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 13:20:14,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:14,889 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:20:14,897 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 13:20:15,090 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 13:20:15,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:15,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1512676628, now seen corresponding path program 1 times [2025-01-09 13:20:15,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:20:15,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244702576] [2025-01-09 13:20:15,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:15,093 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 13:20:15,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:20:15,095 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 13:20:15,111 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 13:20:15,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 13:20:15,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 13:20:15,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:15,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:15,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 13:20:15,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 13:20:40,149 INFO L312 TraceCheckSpWp]: Computing backward predicates...