./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:17:43,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:17:43,668 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:17:43,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:17:43,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:17:43,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:17:43,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:17:43,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:17:43,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:17:43,686 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:17:43,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:17:43,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:17:43,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:17:43,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:17:43,687 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:17:43,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:17:43,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:17:43,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:17:43,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:17:43,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:17:43,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:17:43,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:17:43,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:17:43,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:17:43,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:17:43,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:17:43,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:17:43,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:17:43,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:17:43,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:17:43,690 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 -> edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda [2025-01-09 14:17:43,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:17:43,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:17:43,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:17:43,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:17:43,890 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:17:43,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2025-01-09 14:17:45,072 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c8f87979/29184e7a00574a16b7930e6e5342855e/FLAGc5cbb12e4 [2025-01-09 14:17:45,301 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:17:45,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2025-01-09 14:17:45,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c8f87979/29184e7a00574a16b7930e6e5342855e/FLAGc5cbb12e4 [2025-01-09 14:17:45,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c8f87979/29184e7a00574a16b7930e6e5342855e [2025-01-09 14:17:45,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:17:45,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:17:45,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:17:45,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:17:45,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:17:45,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445c76b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45, skipping insertion in model container [2025-01-09 14:17:45,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:17:45,786 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_amount10_file-62.i[915,928] [2025-01-09 14:17:45,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:17:45,818 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:17:45,825 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_amount10_file-62.i[915,928] [2025-01-09 14:17:45,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:17:45,852 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:17:45,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45 WrapperNode [2025-01-09 14:17:45,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:17:45,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:17:45,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:17:45,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:17:45,861 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:17:45" (1/1) ... [2025-01-09 14:17:45,865 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:17:45" (1/1) ... [2025-01-09 14:17:45,880 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2025-01-09 14:17:45,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:17:45,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:17:45,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:17:45,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:17:45,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,907 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:17:45,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:17:45,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:17:45,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:17:45,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:17:45,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (1/1) ... [2025-01-09 14:17:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:17:45,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:17:45,956 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:17:45,958 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:17:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:17:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:17:45,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:17:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:17:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:17:45,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:17:46,027 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:17:46,028 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:17:46,172 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 14:17:46,172 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:17:46,182 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:17:46,182 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:17:46,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:17:46 BoogieIcfgContainer [2025-01-09 14:17:46,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:17:46,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:17:46,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:17:46,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:17:46,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:17:45" (1/3) ... [2025-01-09 14:17:46,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27656b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:17:46, skipping insertion in model container [2025-01-09 14:17:46,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:45" (2/3) ... [2025-01-09 14:17:46,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27656b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:17:46, skipping insertion in model container [2025-01-09 14:17:46,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:17:46" (3/3) ... [2025-01-09 14:17:46,191 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-62.i [2025-01-09 14:17:46,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:17:46,205 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-62.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:17:46,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:17:46,262 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;@628f5e21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:17:46,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:17:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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:17:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 14:17:46,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:17:46,272 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:17:46,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:17:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:17:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash 845898262, now seen corresponding path program 1 times [2025-01-09 14:17:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:17:46,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962351436] [2025-01-09 14:17:46,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:17:46,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:17:46,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:17:46,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:17:46,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:46,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:17:46,453 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:17:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:17:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962351436] [2025-01-09 14:17:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962351436] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:17:46,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798863132] [2025-01-09 14:17:46,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:17:46,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:17:46,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:17:46,457 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:17:46,464 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:17:46,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:17:46,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:17:46,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:46,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:17:46,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:17:46,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:17:46,576 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:17:46,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:17:46,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798863132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:17:46,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:17:46,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:17:46,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407712853] [2025-01-09 14:17:46,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:17:46,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:17:46,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:17:46,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:17:46,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:17:46,602 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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:17:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:17:46,621 INFO L93 Difference]: Finished difference Result 72 states and 111 transitions. [2025-01-09 14:17:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:17:46,622 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:17:46,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:17:46,626 INFO L225 Difference]: With dead ends: 72 [2025-01-09 14:17:46,626 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 14:17:46,628 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:17:46,630 INFO L435 NwaCegarLoop]: 48 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, 48 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:17:46,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:17:46,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 14:17:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 14:17:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:17:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-01-09 14:17:46,653 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 69 [2025-01-09 14:17:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:17:46,653 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-01-09 14:17:46,654 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:17:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-01-09 14:17:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 14:17:46,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:17:46,655 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:17:46,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:17:46,860 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:17:46,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:17:46,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:17:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1555313246, now seen corresponding path program 1 times [2025-01-09 14:17:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:17:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956692877] [2025-01-09 14:17:46,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:17:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:17:46,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:17:46,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:17:46,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:46,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:17:47,157 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:17:47,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:17:47,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956692877] [2025-01-09 14:17:47,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956692877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:17:47,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:17:47,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:17:47,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265424950] [2025-01-09 14:17:47,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:17:47,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:17:47,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:17:47,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:17:47,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:17:47,159 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:17:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:17:47,220 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-01-09 14:17:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:17:47,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:17:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:17:47,221 INFO L225 Difference]: With dead ends: 55 [2025-01-09 14:17:47,221 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 14:17:47,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:17:47,222 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:17:47,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 221 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:17:47,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 14:17:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2025-01-09 14:17:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:17:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2025-01-09 14:17:47,227 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 69 [2025-01-09 14:17:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:17:47,228 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-01-09 14:17:47,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:17:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2025-01-09 14:17:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 14:17:47,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:17:47,229 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:17:47,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:17:47,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:17:47,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:17:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash -219694116, now seen corresponding path program 1 times [2025-01-09 14:17:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:17:47,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832337356] [2025-01-09 14:17:47,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:17:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:17:47,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:17:47,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:17:47,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:47,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:17:47,405 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:17:47,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:17:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832337356] [2025-01-09 14:17:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832337356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:17:47,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:17:47,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:17:47,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417490352] [2025-01-09 14:17:47,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:17:47,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:17:47,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:17:47,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:17:47,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:17:47,410 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:17:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:17:47,445 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2025-01-09 14:17:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:17:47,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:17:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:17:47,446 INFO L225 Difference]: With dead ends: 88 [2025-01-09 14:17:47,446 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 14:17:47,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:17:47,449 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:17:47,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:17:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 14:17:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2025-01-09 14:17:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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:17:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-01-09 14:17:47,455 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 69 [2025-01-09 14:17:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:17:47,456 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-01-09 14:17:47,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:17:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2025-01-09 14:17:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 14:17:47,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:17:47,458 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:17:47,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:17:47,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:17:47,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:17:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash 734510043, now seen corresponding path program 1 times [2025-01-09 14:17:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:17:47,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533507850] [2025-01-09 14:17:47,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:17:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:17:47,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 14:17:47,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 14:17:47,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:47,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:17:47,829 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:17:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:17:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533507850] [2025-01-09 14:17:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533507850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:17:47,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:17:47,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:17:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995553668] [2025-01-09 14:17:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:17:47,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:17:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:17:47,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:17:47,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:17:47,831 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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:17:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:17:47,909 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-01-09 14:17:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:17:47,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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:17:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:17:47,910 INFO L225 Difference]: With dead ends: 58 [2025-01-09 14:17:47,910 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 14:17:47,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:17:47,911 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:17:47,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 217 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:17:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 14:17:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2025-01-09 14:17:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 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:17:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-01-09 14:17:47,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 70 [2025-01-09 14:17:47,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:17:47,920 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-01-09 14:17:47,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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:17:47,920 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2025-01-09 14:17:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 14:17:47,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:17:47,921 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:17:47,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:17:47,921 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:17:47,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:17:47,922 INFO L85 PathProgramCache]: Analyzing trace with hash 736357085, now seen corresponding path program 1 times [2025-01-09 14:17:47,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:17:47,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423222720] [2025-01-09 14:17:47,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:17:47,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:17:47,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 14:17:47,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 14:17:47,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:47,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:17:47,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:17:47,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 14:17:47,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 14:17:47,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:47,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:17:47,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:17:47,988 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:17:47,989 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:17:47,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:17:47,992 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 14:17:48,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:17:48,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:17:48 BoogieIcfgContainer [2025-01-09 14:17:48,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:17:48,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:17:48,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:17:48,032 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:17:48,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:17:46" (3/4) ... [2025-01-09 14:17:48,035 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:17:48,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:17:48,036 INFO L158 Benchmark]: Toolchain (without parser) took 2392.09ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 55.4MB in the end (delta: 68.9MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2025-01-09 14:17:48,037 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:17:48,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.42ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:17:48,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.29ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.9MB in the end (delta: 819.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:17:48,037 INFO L158 Benchmark]: Boogie Preprocessor took 37.90ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:17:48,037 INFO L158 Benchmark]: RCFGBuilder took 261.50ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 95.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:17:48,038 INFO L158 Benchmark]: TraceAbstraction took 1846.75ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 55.4MB in the end (delta: 40.4MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2025-01-09 14:17:48,038 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 167.8MB. Free memory was 55.4MB in the beginning and 55.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:17:48,040 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.20ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.42ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.29ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.9MB in the end (delta: 819.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.90ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 261.50ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 95.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1846.75ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 55.4MB in the end (delta: 40.4MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 167.8MB. Free memory was 55.4MB in the beginning and 55.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 31.95; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 255.6; [L25] double var_1_4 = 50.8; [L26] double var_1_5 = 4.4; [L27] double var_1_6 = 100.8; [L28] unsigned char var_1_7 = 50; [L29] signed long int var_1_8 = 256; [L30] unsigned char var_1_9 = 25; VAL [isInitial=0, var_1_1=639/20, var_1_2=0, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L70] isInitial = 1 [L71] FCALL initially() [L73] FCALL updateLastVariables() [L74] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=639/20, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L48] var_1_3 = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L49] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L50] var_1_4 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L51] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L52] var_1_5 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L53] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L54] var_1_6 = __VERIFIER_nondet_double() [L55] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=256, var_1_9=25] [L55] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=256, var_1_9=25] [L56] var_1_8 = __VERIFIER_nondet_long() [L57] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=25] [L57] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=25] [L58] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=25] [L58] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=25] [L59] var_1_9 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0] [L60] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0] [L61] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] [L61] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] [L74] RET updateVariables() [L75] CALL step() [L34] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] [L37] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-256, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] [L38] COND TRUE (-10 != var_1_8) || stepLocal_0 VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] [L39] COND FALSE !(var_1_1 >= 500.5) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] [L75] RET step() [L76] CALL, EXPR property() [L66-L67] return (var_1_2 ? (var_1_1 == ((double) (var_1_3 + ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))))) : 1) && (((-10 != var_1_8) || var_1_2) ? ((var_1_1 >= 500.5) ? (var_1_7 == ((unsigned char) var_1_9)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] [L76] RET, EXPR property() [L76] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] [L19] reach_error() VAL [isInitial=1, var_1_1=639/20, var_1_2=-256, var_1_7=50, var_1_8=0, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 630 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 428 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 202 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=4, InterpolantAutomatonStates: 18, 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, 4 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 341 ConstructedInterpolants, 0 QuantifiedInterpolants, 419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 882/900 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:17:48,056 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_amount10_file-62.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:17:49,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:17:49,960 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:17:49,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:17:49,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:17:49,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:17:49,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:17:49,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:17:49,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:17:49,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:17:49,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:17:49,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:17:49,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:17:49,991 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:17:49,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:17:49,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:17:49,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:17:49,992 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:17:49,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:17:49,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:17:49,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:17:49,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:17:49,993 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 -> edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda [2025-01-09 14:17:50,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:17:50,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:17:50,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:17:50,230 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:17:50,230 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:17:50,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2025-01-09 14:17:51,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ff824702/6f09196bdbe34ed2a58058769baf9d6c/FLAGa1a0b1920 [2025-01-09 14:17:51,681 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:17:51,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2025-01-09 14:17:51,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ff824702/6f09196bdbe34ed2a58058769baf9d6c/FLAGa1a0b1920 [2025-01-09 14:17:51,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ff824702/6f09196bdbe34ed2a58058769baf9d6c [2025-01-09 14:17:52,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:17:52,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:17:52,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:17:52,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:17:52,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:17:52,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4572b8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52, skipping insertion in model container [2025-01-09 14:17:52,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:17:52,108 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_amount10_file-62.i[915,928] [2025-01-09 14:17:52,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:17:52,151 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:17:52,160 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_amount10_file-62.i[915,928] [2025-01-09 14:17:52,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:17:52,183 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:17:52,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52 WrapperNode [2025-01-09 14:17:52,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:17:52,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:17:52,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:17:52,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:17:52,191 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:17:52" (1/1) ... [2025-01-09 14:17:52,202 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:17:52" (1/1) ... [2025-01-09 14:17:52,220 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2025-01-09 14:17:52,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:17:52,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:17:52,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:17:52,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:17:52,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,241 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:17:52,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:17:52,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:17:52,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:17:52,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:17:52,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (1/1) ... [2025-01-09 14:17:52,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:17:52,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:17:52,304 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:17:52,307 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:17:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:17:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:17:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:17:52,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:17:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:17:52,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:17:52,379 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:17:52,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:17:52,865 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 14:17:52,865 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:17:52,872 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:17:52,874 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:17:52,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:17:52 BoogieIcfgContainer [2025-01-09 14:17:52,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:17:52,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:17:52,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:17:52,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:17:52,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:17:52" (1/3) ... [2025-01-09 14:17:52,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517b7046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:17:52, skipping insertion in model container [2025-01-09 14:17:52,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:17:52" (2/3) ... [2025-01-09 14:17:52,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517b7046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:17:52, skipping insertion in model container [2025-01-09 14:17:52,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:17:52" (3/3) ... [2025-01-09 14:17:52,882 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-62.i [2025-01-09 14:17:52,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:17:52,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-62.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:17:52,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:17:52,943 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;@bf993a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:17:52,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:17:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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:17:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 14:17:52,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:17:52,952 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:17:52,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:17:52,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:17:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash 845898262, now seen corresponding path program 1 times [2025-01-09 14:17:52,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:17:52,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431378222] [2025-01-09 14:17:52,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:17:52,963 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:17:52,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:17:52,970 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:17:52,971 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:17:53,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:17:53,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:17:53,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:53,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:17:53,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:17:53,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:17:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 14:17:53,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:17:53,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:17:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431378222] [2025-01-09 14:17:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431378222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:17:53,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:17:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:17:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712582002] [2025-01-09 14:17:53,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:17:53,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:17:53,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:17:53,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:17:53,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:17:53,191 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 14:17:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:17:53,229 INFO L93 Difference]: Finished difference Result 72 states and 111 transitions. [2025-01-09 14:17:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:17:53,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-01-09 14:17:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:17:53,235 INFO L225 Difference]: With dead ends: 72 [2025-01-09 14:17:53,236 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 14:17:53,238 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:17:53,240 INFO L435 NwaCegarLoop]: 48 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, 48 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:17:53,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:17:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 14:17:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 14:17:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:17:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-01-09 14:17:53,274 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 69 [2025-01-09 14:17:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:17:53,275 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-01-09 14:17:53,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 14:17:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-01-09 14:17:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 14:17:53,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:17:53,278 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:17:53,285 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:17:53,483 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:17:53,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:17:53,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:17:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1555313246, now seen corresponding path program 1 times [2025-01-09 14:17:53,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:17:53,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032341226] [2025-01-09 14:17:53,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:17:53,487 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:17:53,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:17:53,492 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:17:53,501 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:17:53,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 14:17:53,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 14:17:53,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:17:53,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:17:53,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:17:53,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:14,115 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)