./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_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_operatoramount_amount25_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 ee31227ad27ad39acff6b0aaf8fcd87c03115ab52de32946a18b44c8bd24cced --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:35:36,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:35:36,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:35:36,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:35:36,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:35:36,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:35:36,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:35:36,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:35:36,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:35:36,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:35:36,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:35:36,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:35:36,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:35:36,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:35:36,732 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:35:36,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:35:36,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:35:36,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:35:36,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:35:36,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:35:36,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:35:36,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:35:36,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:35:36,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:35:36,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:35:36,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:35:36,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:35:36,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:35:36,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:35:36,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:36,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:36,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:35:36,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:35:36,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:35:36,735 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 -> ee31227ad27ad39acff6b0aaf8fcd87c03115ab52de32946a18b44c8bd24cced [2025-01-09 14:35:36,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:35:36,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:35:36,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:35:36,990 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:35:36,991 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:35:36,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-46.i [2025-01-09 14:35:38,264 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bb2615c8/57dfb0b29d8b422b812c283b73bb24e5/FLAG6bb86fa08 [2025-01-09 14:35:38,518 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:35:38,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-46.i [2025-01-09 14:35:38,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bb2615c8/57dfb0b29d8b422b812c283b73bb24e5/FLAG6bb86fa08 [2025-01-09 14:35:38,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bb2615c8/57dfb0b29d8b422b812c283b73bb24e5 [2025-01-09 14:35:38,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:35:38,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:35:38,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:35:38,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:35:38,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:35:38,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38, skipping insertion in model container [2025-01-09 14:35:38,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:35:38,647 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_operatoramount_amount25_file-46.i[915,928] [2025-01-09 14:35:38,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:35:38,694 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:35:38,704 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_operatoramount_amount25_file-46.i[915,928] [2025-01-09 14:35:38,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:35:38,738 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:35:38,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38 WrapperNode [2025-01-09 14:35:38,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:35:38,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:35:38,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:35:38,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:35:38,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,770 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2025-01-09 14:35:38,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:35:38,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:35:38,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:35:38,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:35:38,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,805 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 14:35:38,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,809 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:35:38,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:35:38,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:35:38,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:35:38,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (1/1) ... [2025-01-09 14:35:38,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:35:38,853 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 14:35:38,857 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 14:35:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:35:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:35:38,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:35:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:35:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:35:38,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:35:38,928 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:35:38,930 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:35:39,090 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 14:35:39,090 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:35:39,096 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:35:39,096 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:35:39,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:39 BoogieIcfgContainer [2025-01-09 14:35:39,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:35:39,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:35:39,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:35:39,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:35:39,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:35:38" (1/3) ... [2025-01-09 14:35:39,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3ff38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:35:39, skipping insertion in model container [2025-01-09 14:35:39,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:38" (2/3) ... [2025-01-09 14:35:39,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3ff38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:35:39, skipping insertion in model container [2025-01-09 14:35:39,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:39" (3/3) ... [2025-01-09 14:35:39,104 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-46.i [2025-01-09 14:35:39,113 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:35:39,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-46.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:35:39,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:35:39,154 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;@5ca85a2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:35:39,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:35:39,157 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 14:35:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 14:35:39,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:35:39,162 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 14:35:39,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:35:39,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:35:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash -718637899, now seen corresponding path program 1 times [2025-01-09 14:35:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:35:39,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232711639] [2025-01-09 14:35:39,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:35:39,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:35:39,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:35:39,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:39,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:39,348 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 14:35:39,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:35:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232711639] [2025-01-09 14:35:39,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232711639] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:35:39,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728994998] [2025-01-09 14:35:39,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:39,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:35:39,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:35:39,358 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 14:35:39,360 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 14:35:39,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:35:39,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:35:39,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:39,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:39,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:35:39,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:35:39,463 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 14:35:39,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:35:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728994998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:35:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:35:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:35:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560674116] [2025-01-09 14:35:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:35:39,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:35:39,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:35:39,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:35:39,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:35:39,490 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 14:35:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:35:39,502 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2025-01-09 14:35:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:35:39,503 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 14:35:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:35:39,507 INFO L225 Difference]: With dead ends: 78 [2025-01-09 14:35:39,507 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 14:35:39,509 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 14:35:39,510 INFO L435 NwaCegarLoop]: 55 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, 55 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 14:35:39,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:35:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 14:35:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 14:35:39,531 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 14:35:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2025-01-09 14:35:39,534 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 69 [2025-01-09 14:35:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:35:39,535 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2025-01-09 14:35:39,535 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 14:35:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2025-01-09 14:35:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 14:35:39,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:35:39,537 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 14:35:39,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:35:39,737 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 14:35:39,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:35:39,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:35:39,739 INFO L85 PathProgramCache]: Analyzing trace with hash 651389361, now seen corresponding path program 1 times [2025-01-09 14:35:39,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:35:39,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682809729] [2025-01-09 14:35:39,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:35:39,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:35:39,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:35:39,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:39,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:35:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669064527] [2025-01-09 14:35:39,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:39,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:35:39,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:35:39,820 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 14:35:39,821 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 14:35:39,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:35:39,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:35:39,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:39,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:35:39,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:35:39,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:35:39,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:35:39,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:39,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:35:39,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:35:39,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:35:39,982 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:35:39,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:35:40,184 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 14:35:40,187 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 14:35:40,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:35:40,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:35:40 BoogieIcfgContainer [2025-01-09 14:35:40,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:35:40,217 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:35:40,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:35:40,217 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:35:40,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:39" (3/4) ... [2025-01-09 14:35:40,219 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:35:40,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:35:40,220 INFO L158 Benchmark]: Toolchain (without parser) took 1675.79ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 75.0MB in the end (delta: 84.7MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-09 14:35:40,220 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 218.1MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:35:40,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.72ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 147.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:35:40,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.14ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 145.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:35:40,221 INFO L158 Benchmark]: Boogie Preprocessor took 43.78ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 142.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:35:40,221 INFO L158 Benchmark]: RCFGBuilder took 274.86ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 128.1MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:35:40,221 INFO L158 Benchmark]: TraceAbstraction took 1117.58ms. Allocated memory is still 201.3MB. Free memory was 127.5MB in the beginning and 75.3MB in the end (delta: 52.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 14:35:40,221 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 201.3MB. Free memory was 75.3MB in the beginning and 75.0MB in the end (delta: 319.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:35:40,222 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 218.1MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.72ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 147.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.14ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 145.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.78ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 142.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 274.86ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 128.1MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1117.58ms. Allocated memory is still 201.3MB. Free memory was 127.5MB in the beginning and 75.3MB in the end (delta: 52.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 201.3MB. Free memory was 75.3MB in the beginning and 75.0MB in the end (delta: 319.0kB). 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() [L95] 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] [L95] RET updateLastVariables() [L96] 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [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=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [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=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [L96] RET updateVariables() [L97] 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=-2, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [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=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [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=-2, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [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=-2, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L60] signed long int stepLocal_4 = var_1_8 * var_1_8; VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-2, stepLocal_1=0, stepLocal_2=1, stepLocal_4=1, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L61] COND FALSE !(0 > stepLocal_4) VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-2, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L97] RET step() [L98] 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=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L98] RET, EXPR property() [L98] 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=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, 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, 55 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, 55 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, 172 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 14:35:40,237 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_operatoramount_amount25_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 ee31227ad27ad39acff6b0aaf8fcd87c03115ab52de32946a18b44c8bd24cced --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:35:42,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:35:42,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:35:42,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:35:42,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:35:42,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:35:42,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:35:42,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:35:42,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:35:42,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:35:42,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:35:42,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:35:42,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:35:42,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:35:42,305 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:35:42,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:35:42,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:35:42,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:35:42,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:35:42,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:35:42,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:35:42,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:35:42,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:35:42,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:35:42,316 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:35:42,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:42,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:35:42,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:42,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:35:42,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:35:42,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:35:42,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:35:42,318 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:35:42,318 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:35:42,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:35:42,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:35:42,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:35:42,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:35:42,318 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 -> ee31227ad27ad39acff6b0aaf8fcd87c03115ab52de32946a18b44c8bd24cced [2025-01-09 14:35:42,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:35:42,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:35:42,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:35:42,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:35:42,605 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:35:42,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-46.i [2025-01-09 14:35:43,752 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/857e7c170/af4b292d6e354cde82d7fcf9e184a858/FLAGf5b7a05c5 [2025-01-09 14:35:43,988 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:35:43,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-46.i [2025-01-09 14:35:44,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/857e7c170/af4b292d6e354cde82d7fcf9e184a858/FLAGf5b7a05c5 [2025-01-09 14:35:44,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/857e7c170/af4b292d6e354cde82d7fcf9e184a858 [2025-01-09 14:35:44,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:35:44,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:35:44,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:35:44,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:35:44,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:35:44,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfc3084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44, skipping insertion in model container [2025-01-09 14:35:44,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:35:44,446 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_operatoramount_amount25_file-46.i[915,928] [2025-01-09 14:35:44,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:35:44,486 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:35:44,494 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_operatoramount_amount25_file-46.i[915,928] [2025-01-09 14:35:44,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:35:44,513 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:35:44,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44 WrapperNode [2025-01-09 14:35:44,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:35:44,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:35:44,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:35:44,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:35:44,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,534 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-01-09 14:35:44,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:35:44,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:35:44,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:35:44,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:35:44,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,548 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 14:35:44,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:35:44,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:35:44,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:35:44,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:35:44,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (1/1) ... [2025-01-09 14:35:44,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:35:44,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:35:44,586 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 14:35:44,597 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 14:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:35:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:35:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:35:44,671 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:35:44,673 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:35:44,891 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 14:35:44,891 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:35:44,898 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:35:44,898 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:35:44,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:44 BoogieIcfgContainer [2025-01-09 14:35:44,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:35:44,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:35:44,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:35:44,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:35:44,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:35:44" (1/3) ... [2025-01-09 14:35:44,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73288168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:35:44, skipping insertion in model container [2025-01-09 14:35:44,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:35:44" (2/3) ... [2025-01-09 14:35:44,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73288168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:35:44, skipping insertion in model container [2025-01-09 14:35:44,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:35:44" (3/3) ... [2025-01-09 14:35:44,908 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-46.i [2025-01-09 14:35:44,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:35:44,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-46.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:35:44,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:35:44,970 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;@705df73d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:35:44,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:35:44,973 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 14:35:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 14:35:44,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:35:44,980 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 14:35:44,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:35:44,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:35:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash -718637899, now seen corresponding path program 1 times [2025-01-09 14:35:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:35:44,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348807244] [2025-01-09 14:35:44,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:44,991 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 14:35:44,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:35:44,993 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 14:35:44,995 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 14:35:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:35:45,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:35:45,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:45,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:45,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:35:45,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:35:45,156 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 14:35:45,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:35:45,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:35:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348807244] [2025-01-09 14:35:45,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348807244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:35:45,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:35:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:35:45,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752206808] [2025-01-09 14:35:45,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:35:45,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:35:45,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:35:45,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:35:45,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:35:45,196 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 14:35:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:35:45,211 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2025-01-09 14:35:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:35:45,212 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 14:35:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:35:45,216 INFO L225 Difference]: With dead ends: 78 [2025-01-09 14:35:45,217 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 14:35:45,219 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 14:35:45,221 INFO L435 NwaCegarLoop]: 55 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, 55 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 14:35:45,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:35:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 14:35:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 14:35:45,245 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 14:35:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2025-01-09 14:35:45,251 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 69 [2025-01-09 14:35:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:35:45,252 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2025-01-09 14:35:45,252 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 14:35:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2025-01-09 14:35:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 14:35:45,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:35:45,255 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 14:35:45,263 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 14:35:45,456 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 14:35:45,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:35:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:35:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash 651389361, now seen corresponding path program 1 times [2025-01-09 14:35:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:35:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998689488] [2025-01-09 14:35:45,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:45,459 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 14:35:45,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:35:45,462 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 14:35:45,463 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 14:35:45,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:35:45,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:35:45,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:45,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:45,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 14:35:45,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:36:31,743 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 14:36:31,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:36:31,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:36:31,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998689488] [2025-01-09 14:36:31,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998689488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:36:31,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:36:31,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:36:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136521016] [2025-01-09 14:36:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:36:31,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:36:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:36:31,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:36:31,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:36:31,746 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 14:36:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:36:32,017 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2025-01-09 14:36:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:36:32,018 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 14:36:32,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:36:32,019 INFO L225 Difference]: With dead ends: 71 [2025-01-09 14:36:32,019 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 14:36:32,019 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 14:36:32,020 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:36:32,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 264 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:36:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 14:36:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-01-09 14:36:32,026 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 14:36:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-01-09 14:36:32,027 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 69 [2025-01-09 14:36:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:36:32,027 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-01-09 14:36:32,027 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 14:36:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2025-01-09 14:36:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 14:36:32,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:36:32,029 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 14:36:32,034 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 14:36:32,229 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 14:36:32,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:36:32,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:36:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash -370688465, now seen corresponding path program 1 times [2025-01-09 14:36:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:36:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437276082] [2025-01-09 14:36:32,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:36:32,233 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 14:36:32,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:36:32,235 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 14:36:32,237 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 14:36:32,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 14:36:32,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 14:36:32,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:36:32,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:36:32,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:36:32,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:36:54,309 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 14:36:54,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:36:54,310 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:36:54,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437276082] [2025-01-09 14:36:54,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437276082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:36:54,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:36:54,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:36:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200331300] [2025-01-09 14:36:54,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:36:54,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:36:54,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:36:54,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:36:54,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:36:54,311 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 14:36:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:36:55,309 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2025-01-09 14:36:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:36:55,310 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 14:36:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:36:55,315 INFO L225 Difference]: With dead ends: 77 [2025-01-09 14:36:55,315 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 14:36:55,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:36:55,316 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 14:36:55,317 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 14:36:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 14:36:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2025-01-09 14:36:55,323 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 14:36:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-01-09 14:36:55,324 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 70 [2025-01-09 14:36:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:36:55,324 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-01-09 14:36:55,324 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 14:36:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2025-01-09 14:36:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 14:36:55,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:36:55,325 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 14:36:55,332 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 14:36:55,529 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 14:36:55,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:36:55,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:36:55,530 INFO L85 PathProgramCache]: Analyzing trace with hash -394784881, now seen corresponding path program 1 times [2025-01-09 14:36:55,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:36:55,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191980910] [2025-01-09 14:36:55,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:36:55,530 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 14:36:55,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:36:55,532 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 14:36:55,534 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 14:36:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 14:36:55,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 14:36:55,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:36:55,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:36:55,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:36:55,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:36:57,484 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 14:36:57,484 INFO L312 TraceCheckSpWp]: Computing backward predicates...