./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-46.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-46.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 62c16d91e787288ae99ac41232bb0baaa3c2e24a529da812094625072884fa10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:18:08,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:18:08,772 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:18:08,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:18:08,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:18:08,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:18:08,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:18:08,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:18:08,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:18:08,799 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:18:08,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:18:08,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:18:08,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:18:08,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:18:08,800 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:18:08,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:18:08,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:18:08,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:18:08,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:18:08,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:18:08,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:18:08,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:18:08,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:18:08,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:18:08,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:08,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:08,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:18:08,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:18:08,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:18:08,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:18:08,803 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 -> 62c16d91e787288ae99ac41232bb0baaa3c2e24a529da812094625072884fa10 [2025-01-09 13:18:09,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:18:09,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:18:09,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:18:09,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:18:09,060 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:18:09,060 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-46.i [2025-01-09 13:18:10,296 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6947e2fc0/ce754b50824b47f49c91d189f7178416/FLAGab0fa4b51 [2025-01-09 13:18:10,552 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:18:10,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-46.i [2025-01-09 13:18:10,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6947e2fc0/ce754b50824b47f49c91d189f7178416/FLAGab0fa4b51 [2025-01-09 13:18:10,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6947e2fc0/ce754b50824b47f49c91d189f7178416 [2025-01-09 13:18:10,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:18:10,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:18:10,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:18:10,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:18:10,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:18:10,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfbee9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10, skipping insertion in model container [2025-01-09 13:18:10,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:18:10,676 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-46.i[915,928] [2025-01-09 13:18:10,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:18:10,705 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:18:10,712 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-46.i[915,928] [2025-01-09 13:18:10,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:18:10,731 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:18:10,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10 WrapperNode [2025-01-09 13:18:10,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:18:10,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:18:10,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:18:10,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:18:10,736 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:18:10" (1/1) ... [2025-01-09 13:18:10,741 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:18:10" (1/1) ... [2025-01-09 13:18:10,755 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2025-01-09 13:18:10,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:18:10,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:18:10,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:18:10,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:18:10,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,771 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:18:10,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:18:10,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:18:10,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:18:10,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:18:10,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (1/1) ... [2025-01-09 13:18:10,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:10,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:18:10,807 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:18:10,817 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:18:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:18:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:18:10,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:18:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:18:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:18:10,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:18:10,931 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:18:10,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:18:11,062 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 13:18:11,062 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:18:11,068 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:18:11,068 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:18:11,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:11 BoogieIcfgContainer [2025-01-09 13:18:11,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:18:11,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:18:11,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:18:11,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:18:11,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:18:10" (1/3) ... [2025-01-09 13:18:11,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f116b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:18:11, skipping insertion in model container [2025-01-09 13:18:11,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:10" (2/3) ... [2025-01-09 13:18:11,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f116b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:18:11, skipping insertion in model container [2025-01-09 13:18:11,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:11" (3/3) ... [2025-01-09 13:18:11,075 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-46.i [2025-01-09 13:18:11,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:18:11,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-46.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:18:11,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:18:11,121 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;@6ca2c5cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:18:11,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:18:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:18:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:18:11,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:11,128 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:11,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:11,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash -718637899, now seen corresponding path program 1 times [2025-01-09 13:18:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:18:11,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888080885] [2025-01-09 13:18:11,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:11,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:18:11,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:11,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:11,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:11,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:18:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:18:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888080885] [2025-01-09 13:18:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888080885] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:18:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064419828] [2025-01-09 13:18:11,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:11,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:18:11,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:18:11,297 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:18:11,302 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:18:11,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:11,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:11,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:11,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:11,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:18:11,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:18:11,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:18:11,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064419828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:18:11,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:18:11,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:18:11,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196362656] [2025-01-09 13:18:11,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:18:11,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:18:11,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:18:11,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:18:11,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:18:11,406 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 13:18:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:18:11,418 INFO L93 Difference]: Finished difference Result 81 states and 127 transitions. [2025-01-09 13:18:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:18:11,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-01-09 13:18:11,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:18:11,422 INFO L225 Difference]: With dead ends: 81 [2025-01-09 13:18:11,423 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 13:18:11,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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:18:11,426 INFO L435 NwaCegarLoop]: 58 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, 58 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:18:11,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:18:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 13:18:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 13:18:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:18:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2025-01-09 13:18:11,456 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 69 [2025-01-09 13:18:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:18:11,456 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2025-01-09 13:18:11,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 13:18:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2025-01-09 13:18:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:18:11,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:11,460 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:11,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:18:11,662 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:18:11,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:11,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 651389361, now seen corresponding path program 1 times [2025-01-09 13:18:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:18:11,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818685867] [2025-01-09 13:18:11,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:18:11,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:11,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:11,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:18:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266249858] [2025-01-09 13:18:11,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:11,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:18:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:18:11,744 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:18:11,745 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:18:11,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:11,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:11,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:11,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:18:11,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:18:11,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:11,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:18:11,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:18:11,879 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:18:11,880 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:18:11,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:18:12,086 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:18:12,090 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:18:12,120 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:18:12,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:18:12 BoogieIcfgContainer [2025-01-09 13:18:12,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:18:12,123 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:18:12,123 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:18:12,123 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:18:12,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:11" (3/4) ... [2025-01-09 13:18:12,126 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:18:12,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:18:12,127 INFO L158 Benchmark]: Toolchain (without parser) took 1551.36ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 49.0MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-09 13:18:12,127 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:18:12,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.81ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 120.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:18:12,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.14ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 118.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:18:12,128 INFO L158 Benchmark]: Boogie Preprocessor took 22.78ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 116.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:18:12,128 INFO L158 Benchmark]: RCFGBuilder took 289.53ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 101.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:18:12,128 INFO L158 Benchmark]: TraceAbstraction took 1052.48ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 49.0MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 13:18:12,128 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 167.8MB. Free memory is still 49.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:18:12,130 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.19ms. Allocated memory is still 226.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.81ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 120.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.14ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 118.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.78ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 116.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 289.53ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 101.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1052.48ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 49.0MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 167.8MB. Free memory is still 49.0MB. 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 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 31.75; [L24] signed char var_1_4 = -8; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_8 = 16; [L28] unsigned char var_1_9 = 8; [L29] signed long int var_1_10 = 256; [L30] signed long int last_1_var_1_10 = 256; VAL [isInitial=0, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_2=127/4, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_2=127/4, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L95] COND TRUE k_loop < 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_2=127/4, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_double() [L69] 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_10=256, var_1_10=256, var_1_1=1, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L69] 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_10=256, var_1_10=256, var_1_1=1, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L70] var_1_4 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L71] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L72] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L72] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L73] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L73] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L74] var_1_6 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_7=1, var_1_8=16, var_1_9=8] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_7=1, var_1_8=16, var_1_9=8] [L76] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L76] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L78] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16] [L82] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=2] [L82] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=2] [L97] RET updateVariables() [L98] CALL step() [L34] signed char stepLocal_3 = var_1_4; [L35] unsigned char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_10=256, stepLocal_2=1, stepLocal_3=-3, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=2] [L36] COND TRUE 2 != stepLocal_3 [L37] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, stepLocal_2=1, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=2] [L45] signed long int stepLocal_1 = var_1_8 / var_1_4; [L46] signed long int stepLocal_0 = (((var_1_4) < (var_1_8)) ? (var_1_4) : (var_1_8)); VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-3, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=1, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=2] [L47] COND FALSE !((- var_1_2) >= 16.75) [L58] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-3, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=0, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=2] [L60] signed long int stepLocal_4 = var_1_8 * var_1_8; VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-3, stepLocal_1=0, stepLocal_2=1, stepLocal_4=4, var_1_10=256, var_1_1=0, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=2] [L61] COND FALSE !(0 > stepLocal_4) VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-3, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=0, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=2] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return ((((- var_1_2) >= 16.75) ? (((var_1_8 / var_1_4) >= var_1_8) ? ((((((var_1_4) < (var_1_8)) ? (var_1_4) : (var_1_8))) > -32) ? (var_1_1 == ((unsigned char) 0)) : (var_1_1 == ((unsigned char) var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) : (var_1_1 == ((unsigned char) var_1_6))) && ((2 != var_1_4) ? (var_1_8 == ((unsigned char) var_1_9)) : (((var_1_9 <= last_1_var_1_10) && var_1_7) ? (var_1_8 == ((unsigned char) 128)) : (var_1_8 == ((unsigned char) var_1_9))))) && ((0 > (var_1_8 * var_1_8)) ? (var_1_1 ? (var_1_10 == ((signed long int) 5)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=2] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-3, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 58 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 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:18:12,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-46.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 62c16d91e787288ae99ac41232bb0baaa3c2e24a529da812094625072884fa10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:18:14,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:18:14,097 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:18:14,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:18:14,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:18:14,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:18:14,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:18:14,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:18:14,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:18:14,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:18:14,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:18:14,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:18:14,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:18:14,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:18:14,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:18:14,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:14,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:14,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:18:14,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:18:14,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:18:14,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:18:14,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:18:14,164 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 -> 62c16d91e787288ae99ac41232bb0baaa3c2e24a529da812094625072884fa10 [2025-01-09 13:18:14,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:18:14,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:18:14,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:18:14,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:18:14,425 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:18:14,426 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-46.i [2025-01-09 13:18:15,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4dad47d2/235d1ec3a8944a6aa4a365eca340c8ac/FLAG5e8796ca3 [2025-01-09 13:18:15,845 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:18:15,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-46.i [2025-01-09 13:18:15,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4dad47d2/235d1ec3a8944a6aa4a365eca340c8ac/FLAG5e8796ca3 [2025-01-09 13:18:15,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4dad47d2/235d1ec3a8944a6aa4a365eca340c8ac [2025-01-09 13:18:15,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:18:15,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:18:15,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:18:15,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:18:15,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:18:15,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:15,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b9fb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15, skipping insertion in model container [2025-01-09 13:18:15,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:15,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:18:15,992 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-46.i[915,928] [2025-01-09 13:18:16,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:18:16,033 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:18:16,042 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-46.i[915,928] [2025-01-09 13:18:16,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:18:16,062 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:18:16,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16 WrapperNode [2025-01-09 13:18:16,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:18:16,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:18:16,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:18:16,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:18:16,068 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:18:16" (1/1) ... [2025-01-09 13:18:16,073 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:18:16" (1/1) ... [2025-01-09 13:18:16,089 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-01-09 13:18:16,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:18:16,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:18:16,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:18:16,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:18:16,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,116 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:18:16,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:18:16,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:18:16,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:18:16,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:18:16,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (1/1) ... [2025-01-09 13:18:16,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:16,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:18:16,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:18:16,169 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:18:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:18:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:18:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:18:16,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:18:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:18:16,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:18:16,237 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:18:16,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:18:16,388 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 13:18:16,388 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:18:16,394 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:18:16,394 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:18:16,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:16 BoogieIcfgContainer [2025-01-09 13:18:16,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:18:16,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:18:16,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:18:16,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:18:16,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:18:15" (1/3) ... [2025-01-09 13:18:16,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd82f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:18:16, skipping insertion in model container [2025-01-09 13:18:16,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:16" (2/3) ... [2025-01-09 13:18:16,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd82f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:18:16, skipping insertion in model container [2025-01-09 13:18:16,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:16" (3/3) ... [2025-01-09 13:18:16,401 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-46.i [2025-01-09 13:18:16,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:18:16,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-46.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:18:16,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:18:16,447 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;@6e089250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:18:16,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:18:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:18:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:18:16,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:16,455 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:16,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:16,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:16,459 INFO L85 PathProgramCache]: Analyzing trace with hash -718637899, now seen corresponding path program 1 times [2025-01-09 13:18:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:18:16,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232092375] [2025-01-09 13:18:16,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:16,466 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:18:16,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:18:16,472 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:18:16,473 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:18:16,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:16,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:16,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:16,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:16,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:18:16,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:18:16,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:18:16,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:18:16,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232092375] [2025-01-09 13:18:16,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232092375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:18:16,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:18:16,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:18:16,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219368378] [2025-01-09 13:18:16,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:18:16,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:18:16,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:18:16,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:18:16,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:18:16,643 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:18:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:18:16,660 INFO L93 Difference]: Finished difference Result 81 states and 127 transitions. [2025-01-09 13:18:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:18:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-01-09 13:18:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:18:16,666 INFO L225 Difference]: With dead ends: 81 [2025-01-09 13:18:16,666 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 13:18:16,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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:18:16,671 INFO L435 NwaCegarLoop]: 58 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, 58 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:18:16,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:18:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 13:18:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 13:18:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:18:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2025-01-09 13:18:16,701 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 69 [2025-01-09 13:18:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:18:16,701 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2025-01-09 13:18:16,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:18:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2025-01-09 13:18:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:18:16,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:16,704 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:16,710 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:18:16,905 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:18:16,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:16,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:16,907 INFO L85 PathProgramCache]: Analyzing trace with hash 651389361, now seen corresponding path program 1 times [2025-01-09 13:18:16,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:18:16,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896891121] [2025-01-09 13:18:16,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:16,908 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:18:16,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:18:16,910 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:18:16,914 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:18:16,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:17,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:17,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:17,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:17,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 13:18:17,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 13:19:02,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:19:02,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:19:02,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896891121] [2025-01-09 13:19:02,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896891121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:02,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:02,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:19:02,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916891678] [2025-01-09 13:19:02,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:02,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:19:02,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:19:02,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:19:02,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:19:02,417 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:19:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:02,667 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2025-01-09 13:19:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:19:02,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-01-09 13:19:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:02,668 INFO L225 Difference]: With dead ends: 71 [2025-01-09 13:19:02,668 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 13:19:02,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:19:02,669 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 40 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:02,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 245 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:19:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 13:19:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-01-09 13:19:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 13:19:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-01-09 13:19:02,676 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 69 [2025-01-09 13:19:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:02,677 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-01-09 13:19:02,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:19:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2025-01-09 13:19:02,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 13:19:02,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:02,678 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 13:19:02,879 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:02,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:02,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash -370688465, now seen corresponding path program 1 times [2025-01-09 13:19:02,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:19:02,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913323496] [2025-01-09 13:19:02,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:02,880 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:02,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:19:02,882 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:02,884 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:02,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 13:19:02,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 13:19:02,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:02,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:02,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 13:19:02,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 13:19:24,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:19:24,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:19:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913323496] [2025-01-09 13:19:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913323496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:24,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:24,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:19:24,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525311454] [2025-01-09 13:19:24,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:24,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:19:24,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:19:24,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:19:24,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:19:24,021 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:19:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:25,179 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2025-01-09 13:19:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:19:25,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2025-01-09 13:19:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:25,184 INFO L225 Difference]: With dead ends: 77 [2025-01-09 13:19:25,184 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 13:19:25,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:19:25,186 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 46 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:25,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 305 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:19:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 13:19:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2025-01-09 13:19:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 13:19:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-01-09 13:19:25,198 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 70 [2025-01-09 13:19:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-01-09 13:19:25,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:19:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2025-01-09 13:19:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 13:19:25,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:25,205 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 13:19:25,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:19:25,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:25,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:25,407 INFO L85 PathProgramCache]: Analyzing trace with hash -394784881, now seen corresponding path program 1 times [2025-01-09 13:19:25,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:19:25,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750471498] [2025-01-09 13:19:25,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:25,410 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:25,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:19:25,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:19:25,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 13:19:25,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 13:19:25,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 13:19:25,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:25,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:25,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 13:19:25,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 93 proven. 9 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 13:19:27,337 INFO L312 TraceCheckSpWp]: Computing backward predicates...