./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-50.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-50.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 1fa7c82a4f7bc22dc8d07abee8ad4d9df1173f8da71948b5261089ad194d3531 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:19:09,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:19:09,650 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:19:09,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:19:09,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:19:09,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:19:09,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:19:09,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:19:09,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:19:09,677 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:19:09,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:19:09,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:19:09,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:19:09,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:19:09,679 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:19:09,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:19:09,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:19:09,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:19:09,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:19:09,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:19:09,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:19:09,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:19:09,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:19:09,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:19:09,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:19:09,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:19:09,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:19:09,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:19:09,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:19:09,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:09,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:09,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:09,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:09,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:19:09,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:09,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:09,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:09,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:19:09,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:19:09,682 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 -> 1fa7c82a4f7bc22dc8d07abee8ad4d9df1173f8da71948b5261089ad194d3531 [2025-01-09 13:19:09,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:19:09,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:19:09,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:19:09,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:19:09,897 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:19:09,898 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-50.i [2025-01-09 13:19:11,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcbb8f42b/fd87792598c34edd92376b20a585a89d/FLAG78a884dd2 [2025-01-09 13:19:11,278 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:19:11,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-50.i [2025-01-09 13:19:11,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcbb8f42b/fd87792598c34edd92376b20a585a89d/FLAG78a884dd2 [2025-01-09 13:19:11,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcbb8f42b/fd87792598c34edd92376b20a585a89d [2025-01-09 13:19:11,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:19:11,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:19:11,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:11,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:19:11,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:19:11,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ade8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11, skipping insertion in model container [2025-01-09 13:19:11,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:19:11,688 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-50.i[915,928] [2025-01-09 13:19:11,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:11,720 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:19:11,730 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-50.i[915,928] [2025-01-09 13:19:11,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:11,758 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:19:11,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11 WrapperNode [2025-01-09 13:19:11,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:11,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:11,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:19:11,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:19:11,764 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:19:11" (1/1) ... [2025-01-09 13:19:11,769 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:19:11" (1/1) ... [2025-01-09 13:19:11,783 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-01-09 13:19:11,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:11,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:19:11,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:19:11,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:19:11,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,797 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:19:11,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:19:11,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:19:11,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:19:11,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:19:11,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (1/1) ... [2025-01-09 13:19:11,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:11,829 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:19:11,832 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:19:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:19:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:19:11,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:19:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:19:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:19:11,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:19:11,890 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:19:11,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:19:12,018 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 13:19:12,019 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:19:12,024 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:19:12,025 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:19:12,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:12 BoogieIcfgContainer [2025-01-09 13:19:12,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:19:12,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:19:12,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:19:12,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:19:12,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:19:11" (1/3) ... [2025-01-09 13:19:12,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae6af2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:12, skipping insertion in model container [2025-01-09 13:19:12,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:11" (2/3) ... [2025-01-09 13:19:12,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae6af2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:12, skipping insertion in model container [2025-01-09 13:19:12,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:12" (3/3) ... [2025-01-09 13:19:12,032 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-50.i [2025-01-09 13:19:12,041 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:19:12,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-50.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:19:12,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:19:12,085 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;@2bc91576, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:19:12,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:19:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:19:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 13:19:12,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:12,096 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:12,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:12,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash -46504301, now seen corresponding path program 1 times [2025-01-09 13:19:12,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:12,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734560462] [2025-01-09 13:19:12,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:12,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:19:12,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:19:12,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:12,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 13:19:12,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:12,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734560462] [2025-01-09 13:19:12,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734560462] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:19:12,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319365023] [2025-01-09 13:19:12,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:12,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:12,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:12,301 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:19:12,303 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:19:12,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:19:12,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:19:12,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:12,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:12,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:19:12,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 13:19:12,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:19:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319365023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:12,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:19:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:19:12,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899638121] [2025-01-09 13:19:12,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:12,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:19:12,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:12,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:19:12,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:19:12,463 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:19:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:12,478 INFO L93 Difference]: Finished difference Result 101 states and 163 transitions. [2025-01-09 13:19:12,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:19:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2025-01-09 13:19:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:12,484 INFO L225 Difference]: With dead ends: 101 [2025-01-09 13:19:12,484 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 13:19:12,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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:19:12,488 INFO L435 NwaCegarLoop]: 73 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, 73 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:19:12,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:19:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 13:19:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 13:19:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:19:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-01-09 13:19:12,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 105 [2025-01-09 13:19:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:12,517 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-01-09 13:19:12,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:19:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-01-09 13:19:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 13:19:12,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:12,521 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:12,527 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:19:12,723 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:19:12,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1698937205, now seen corresponding path program 1 times [2025-01-09 13:19:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:12,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036741552] [2025-01-09 13:19:12,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:12,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:19:12,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:19:12,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:12,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 13:19:13,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:13,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036741552] [2025-01-09 13:19:13,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036741552] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:19:13,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367659588] [2025-01-09 13:19:13,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:13,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:13,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:13,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:19:13,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:19:13,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:19:13,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:19:13,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:13,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:13,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 13:19:13,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 238 proven. 54 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 13:19:13,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:19:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 13:19:13,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367659588] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:19:13,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:19:13,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-09 13:19:13,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698531406] [2025-01-09 13:19:13,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:19:13,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:19:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:13,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:19:13,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:19:13,795 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 13:19:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:14,093 INFO L93 Difference]: Finished difference Result 157 states and 218 transitions. [2025-01-09 13:19:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:19:14,093 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 105 [2025-01-09 13:19:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:14,095 INFO L225 Difference]: With dead ends: 157 [2025-01-09 13:19:14,095 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 13:19:14,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:19:14,096 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 139 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:14,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 248 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:19:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 13:19:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 56. [2025-01-09 13:19:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:19:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-01-09 13:19:14,111 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 105 [2025-01-09 13:19:14,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:14,112 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-01-09 13:19:14,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 13:19:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-01-09 13:19:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 13:19:14,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:14,113 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:14,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:19:14,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:14,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:14,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash 76070157, now seen corresponding path program 1 times [2025-01-09 13:19:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-01-09 13:19:14,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:14,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:19:14,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:19:14,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:14,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:19:14,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:19:14,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:19:14,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:19:14,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:14,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:19:14,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:19:14,407 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:19:14,407 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:19:14,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:19:14,410 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 13:19:14,468 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:19:14,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:19:14 BoogieIcfgContainer [2025-01-09 13:19:14,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:19:14,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:19:14,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:19:14,474 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:19:14,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:12" (3/4) ... [2025-01-09 13:19:14,475 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:19:14,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:19:14,477 INFO L158 Benchmark]: Toolchain (without parser) took 2885.53ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 46.5MB in the end (delta: 59.0MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2025-01-09 13:19:14,477 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:14,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.21ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:19:14,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.43ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 90.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:14,479 INFO L158 Benchmark]: Boogie Preprocessor took 21.41ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:14,479 INFO L158 Benchmark]: RCFGBuilder took 219.84ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 74.0MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:19:14,479 INFO L158 Benchmark]: TraceAbstraction took 2445.98ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 46.5MB in the end (delta: 26.8MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2025-01-09 13:19:14,480 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 142.6MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:14,481 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 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.21ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.43ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 90.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.41ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 219.84ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 74.0MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2445.98ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 46.5MB in the end (delta: 26.8MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 142.6MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 8.875; [L24] double var_1_3 = 63.5; [L25] double var_1_4 = 16.6; [L26] double var_1_5 = 127.8; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] signed short int var_1_9 = 256; [L31] signed short int var_1_10 = 10000; [L32] signed short int var_1_11 = 4; [L33] signed short int var_1_12 = -32; [L34] signed long int var_1_13 = 32; [L35] signed short int var_1_14 = 32; [L36] signed long int last_1_var_1_13 = 32; VAL [isInitial=0, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_2=71/8, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L104] isInitial = 1 [L105] FCALL initially() [L106] int k_loop; [L107] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_2=71/8, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L107] COND TRUE k_loop < 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_2=71/8, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L70] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L71] var_1_3 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L72] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L73] var_1_4 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L74] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L75] var_1_5 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L76] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L77] var_1_6 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=256] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=256] [L79] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L79] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L80] var_1_7 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_8=1, var_1_9=256] [L81] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_8=1, var_1_9=256] [L82] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L82] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L83] var_1_8 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L84] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L85] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L85] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L86] var_1_10 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L87] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L88] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L88] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L89] var_1_11 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L91] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L91] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L92] var_1_14 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L94] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L94] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L109] RET updateVariables() [L110] CALL step() [L40] COND FALSE !((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) [L47] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=0, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=256] [L49] COND TRUE var_1_2 > var_1_5 [L50] var_1_9 = (var_1_10 - var_1_11) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=0, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=4] [L52] unsigned char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_13=32, stepLocal_0=-255, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=0, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=4] [L53] COND FALSE !(var_1_1 && stepLocal_0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=0, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=4] [L56] signed short int stepLocal_2 = var_1_9; [L57] signed long int stepLocal_1 = var_1_11 - var_1_14; VAL [isInitial=1, last_1_var_1_13=32, stepLocal_1=0, stepLocal_2=4, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=0, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=4] [L58] COND TRUE var_1_11 <= stepLocal_2 [L59] var_1_13 = (var_1_10 - var_1_11) VAL [isInitial=1, last_1_var_1_13=32, stepLocal_1=0, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=4, var_1_14=0, var_1_1=0, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=4] [L110] RET step() [L111] CALL, EXPR property() [L100-L101] return (((((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) ? (var_1_6 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : (var_1_1 == ((unsigned char) var_1_7))) && ((var_1_2 > var_1_5) ? (var_1_9 == ((signed short int) (var_1_10 - var_1_11))) : 1)) && ((var_1_1 && var_1_8) ? (var_1_12 == ((signed short int) (var_1_11 - 1))) : 1)) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((signed long int) (var_1_10 - var_1_11))) : ((last_1_var_1_13 > (var_1_11 - var_1_14)) ? (var_1_13 == ((signed long int) last_1_var_1_13)) : (var_1_13 == ((signed long int) last_1_var_1_13)))) ; VAL [\result=0, isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=4, var_1_14=0, var_1_1=0, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=4] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=4, var_1_14=0, var_1_1=0, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=32, var_1_10=4, var_1_11=0, var_1_12=-32, var_1_13=4, var_1_14=0, var_1_1=0, var_1_6=0, var_1_7=0, var_1_8=-255, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 154 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=2, InterpolantAutomatonStates: 19, 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, 2 MinimizatonAttempts, 55 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 520 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 SizeOfPredicates, 3 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2268/2400 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:19:14,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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-50.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 1fa7c82a4f7bc22dc8d07abee8ad4d9df1173f8da71948b5261089ad194d3531 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:19:16,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:19:16,303 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:19:16,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:19:16,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:19:16,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:19:16,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:19:16,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:19:16,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:19:16,336 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:19:16,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:19:16,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:19:16,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:19:16,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:19:16,337 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:19:16,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:19:16,338 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:19:16,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:16,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:16,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:19:16,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:19:16,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:19:16,341 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 -> 1fa7c82a4f7bc22dc8d07abee8ad4d9df1173f8da71948b5261089ad194d3531 [2025-01-09 13:19:16,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:19:16,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:19:16,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:19:16,582 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:19:16,582 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:19:16,583 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-50.i [2025-01-09 13:19:17,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c5957d5d/6d8355d7ee9b4416b24993f1509aec95/FLAGb4df2d4fa [2025-01-09 13:19:17,815 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:19:17,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-50.i [2025-01-09 13:19:17,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c5957d5d/6d8355d7ee9b4416b24993f1509aec95/FLAGb4df2d4fa [2025-01-09 13:19:18,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c5957d5d/6d8355d7ee9b4416b24993f1509aec95 [2025-01-09 13:19:18,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:19:18,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:19:18,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:18,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:19:18,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:19:18,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5812e66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18, skipping insertion in model container [2025-01-09 13:19:18,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:19:18,308 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-50.i[915,928] [2025-01-09 13:19:18,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:18,355 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:19:18,362 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-50.i[915,928] [2025-01-09 13:19:18,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:18,389 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:19:18,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18 WrapperNode [2025-01-09 13:19:18,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:18,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:18,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:19:18,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:19:18,396 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:19:18" (1/1) ... [2025-01-09 13:19:18,408 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:19:18" (1/1) ... [2025-01-09 13:19:18,424 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2025-01-09 13:19:18,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:18,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:19:18,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:19:18,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:19:18,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,451 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:19:18,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:19:18,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:19:18,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:19:18,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:19:18,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (1/1) ... [2025-01-09 13:19:18,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:18,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:18,496 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:19:18,499 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:19:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:19:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:19:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:19:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:19:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:19:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:19:18,573 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:19:18,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:19:20,350 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 13:19:20,350 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:19:20,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:19:20,357 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:19:20,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:20 BoogieIcfgContainer [2025-01-09 13:19:20,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:19:20,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:19:20,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:19:20,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:19:20,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:19:18" (1/3) ... [2025-01-09 13:19:20,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdb81c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:20, skipping insertion in model container [2025-01-09 13:19:20,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:18" (2/3) ... [2025-01-09 13:19:20,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdb81c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:20, skipping insertion in model container [2025-01-09 13:19:20,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:20" (3/3) ... [2025-01-09 13:19:20,364 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-50.i [2025-01-09 13:19:20,373 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:19:20,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-50.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:19:20,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:19:20,419 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;@f449cb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:19:20,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:19:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:19:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 13:19:20,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:20,430 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:20,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:20,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash -46504301, now seen corresponding path program 1 times [2025-01-09 13:19:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:19:20,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486067601] [2025-01-09 13:19:20,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:20,442 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:19:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:19:20,444 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:19:20,445 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:19:20,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:19:20,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:19:20,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:20,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:20,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:19:20,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-09 13:19:20,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:19:20,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:19:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486067601] [2025-01-09 13:19:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486067601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:20,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:20,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:19:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899920709] [2025-01-09 13:19:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:20,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:19:20,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:19:20,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:19:20,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:19:20,746 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:19:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:20,759 INFO L93 Difference]: Finished difference Result 101 states and 163 transitions. [2025-01-09 13:19:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:19:20,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2025-01-09 13:19:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:20,764 INFO L225 Difference]: With dead ends: 101 [2025-01-09 13:19:20,764 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 13:19:20,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:19:20,768 INFO L435 NwaCegarLoop]: 73 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, 73 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:19:20,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:19:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 13:19:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 13:19:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:19:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-01-09 13:19:20,805 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 105 [2025-01-09 13:19:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:20,805 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-01-09 13:19:20,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:19:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-01-09 13:19:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 13:19:20,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:20,807 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:20,815 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:19:21,007 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:19:21,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1698937205, now seen corresponding path program 1 times [2025-01-09 13:19:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:19:21,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764086854] [2025-01-09 13:19:21,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:21,009 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:19:21,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:19:21,011 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:19:21,013 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:19:21,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:19:21,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:19:21,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:21,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:21,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 13:19:21,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-01-09 13:19:21,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:19:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 13:19:21,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:19:21,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764086854] [2025-01-09 13:19:21,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764086854] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:19:21,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:19:21,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-01-09 13:19:21,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745082007] [2025-01-09 13:19:21,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:19:21,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:19:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:19:21,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:19:21,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:19:21,566 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 13:19:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:23,797 INFO L93 Difference]: Finished difference Result 157 states and 218 transitions. [2025-01-09 13:19:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:19:23,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 105 [2025-01-09 13:19:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:23,799 INFO L225 Difference]: With dead ends: 157 [2025-01-09 13:19:23,799 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 13:19:23,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:19:23,800 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 130 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:23,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 217 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 13:19:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 13:19:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 56. [2025-01-09 13:19:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:19:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-01-09 13:19:23,810 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 105 [2025-01-09 13:19:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:23,810 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-01-09 13:19:23,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 13:19:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-01-09 13:19:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 13:19:23,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:23,812 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,819 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 13:19:24,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:19:24,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:24,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash 76070157, now seen corresponding path program 1 times [2025-01-09 13:19:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:19:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069830988] [2025-01-09 13:19:24,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:24,017 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:19:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:19:24,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:19:24,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 13:19:24,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:19:24,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:19:24,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:24,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:24,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 13:19:24,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:06,982 WARN L286 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 13:20:48,262 WARN L286 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)