./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.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 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:15:14,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:15:14,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:15:14,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:15:14,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:15:15,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:15:15,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:15:15,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:15:15,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:15:15,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:15:15,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:15:15,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:15:15,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:15:15,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:15:15,005 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:15:15,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:15:15,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:15:15,005 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:15:15,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:15:15,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:15:15,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:15,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:15,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:15,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:15:15,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:15:15,008 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2025-01-09 13:15:15,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:15:15,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:15:15,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:15:15,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:15:15,262 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:15:15,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-01-09 13:15:16,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d447a2106/3d1170b8c61f43fd99854d4e8c721768/FLAG1f28d1506 [2025-01-09 13:15:16,712 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:15:16,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-01-09 13:15:16,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d447a2106/3d1170b8c61f43fd99854d4e8c721768/FLAG1f28d1506 [2025-01-09 13:15:17,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d447a2106/3d1170b8c61f43fd99854d4e8c721768 [2025-01-09 13:15:17,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:15:17,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:15:17,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:17,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:15:17,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:15:17,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5f9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17, skipping insertion in model container [2025-01-09 13:15:17,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:15:17,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-01-09 13:15:17,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:17,224 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:15:17,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-01-09 13:15:17,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:17,261 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:15:17,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17 WrapperNode [2025-01-09 13:15:17,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:17,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:17,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:15:17,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:15:17,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,295 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2025-01-09 13:15:17,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:17,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:15:17,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:15:17,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:15:17,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,317 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:15:17,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:15:17,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:15:17,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:15:17,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:15:17,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (1/1) ... [2025-01-09 13:15:17,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:17,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:17,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:15:17,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:15:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:15:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:15:17,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:15:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:15:17,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:15:17,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:15:17,459 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:15:17,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:15:17,774 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 13:15:17,774 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:15:17,785 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:15:17,785 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:15:17,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:17 BoogieIcfgContainer [2025-01-09 13:15:17,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:15:17,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:15:17,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:15:17,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:15:17,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:15:17" (1/3) ... [2025-01-09 13:15:17,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5c7d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:15:17, skipping insertion in model container [2025-01-09 13:15:17,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:17" (2/3) ... [2025-01-09 13:15:17,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5c7d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:15:17, skipping insertion in model container [2025-01-09 13:15:17,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:17" (3/3) ... [2025-01-09 13:15:17,798 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-01-09 13:15:17,811 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:15:17,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:15:17,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:15:17,878 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;@29baa84b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:15:17,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:15:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:15:17,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 13:15:17,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:17,894 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:17,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:17,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash 605868168, now seen corresponding path program 1 times [2025-01-09 13:15:17,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:17,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257048814] [2025-01-09 13:15:17,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:17,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:18,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 13:15:18,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 13:15:18,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:18,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 13:15:18,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:18,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257048814] [2025-01-09 13:15:18,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257048814] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:15:18,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896045933] [2025-01-09 13:15:18,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:18,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:15:18,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:18,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:15:18,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:15:18,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 13:15:18,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 13:15:18,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:18,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:18,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:15:18,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 13:15:18,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:15:18,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896045933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:18,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:15:18,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:15:18,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327067714] [2025-01-09 13:15:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:18,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:15:18,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:18,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:15:18,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:15:18,333 INFO L87 Difference]: Start difference. First operand has 60 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:15:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:18,348 INFO L93 Difference]: Finished difference Result 117 states and 191 transitions. [2025-01-09 13:15:18,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:15:18,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-01-09 13:15:18,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:18,355 INFO L225 Difference]: With dead ends: 117 [2025-01-09 13:15:18,355 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 13:15:18,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:15:18,362 INFO L435 NwaCegarLoop]: 87 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, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:18,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:15:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 13:15:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 13:15:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:15:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-01-09 13:15:18,398 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 106 [2025-01-09 13:15:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:18,398 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-01-09 13:15:18,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:15:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-01-09 13:15:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 13:15:18,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:18,400 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:18,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:15:18,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:15:18,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:18,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash -257954296, now seen corresponding path program 1 times [2025-01-09 13:15:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:18,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150797176] [2025-01-09 13:15:18,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:18,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:18,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 13:15:18,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 13:15:18,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:18,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:15:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150797176] [2025-01-09 13:15:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150797176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:19,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:19,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:15:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018011070] [2025-01-09 13:15:19,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:19,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:15:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:19,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:15:19,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:15:19,039 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:19,234 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2025-01-09 13:15:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:15:19,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2025-01-09 13:15:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:19,237 INFO L225 Difference]: With dead ends: 166 [2025-01-09 13:15:19,237 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 13:15:19,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:15:19,238 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 62 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:19,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 199 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:15:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 13:15:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2025-01-09 13:15:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:15:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2025-01-09 13:15:19,254 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 106 [2025-01-09 13:15:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:19,257 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2025-01-09 13:15:19,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2025-01-09 13:15:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 13:15:19,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:19,260 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:19,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:15:19,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:19,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1189271346, now seen corresponding path program 1 times [2025-01-09 13:15:19,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:19,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115894157] [2025-01-09 13:15:19,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:19,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 13:15:19,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 13:15:19,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:19,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:15:19,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:19,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115894157] [2025-01-09 13:15:19,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115894157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:19,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:19,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:15:19,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148726955] [2025-01-09 13:15:19,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:15:19,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:19,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:15:19,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:15:19,524 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:19,601 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions. [2025-01-09 13:15:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:15:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-01-09 13:15:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:19,603 INFO L225 Difference]: With dead ends: 188 [2025-01-09 13:15:19,603 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 13:15:19,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:15:19,604 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:19,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 255 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:15:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 13:15:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2025-01-09 13:15:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:15:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-01-09 13:15:19,617 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 110 [2025-01-09 13:15:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:19,617 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-01-09 13:15:19,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-01-09 13:15:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 13:15:19,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:19,620 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:19,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:15:19,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:19,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash -980591147, now seen corresponding path program 1 times [2025-01-09 13:15:19,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:19,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969633681] [2025-01-09 13:15:19,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:19,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:19,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 13:15:19,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 13:15:19,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:19,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:15:20,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969633681] [2025-01-09 13:15:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969633681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:20,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:20,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:15:20,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808850975] [2025-01-09 13:15:20,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:20,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:15:20,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:20,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:15:20,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:15:20,198 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:20,387 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-01-09 13:15:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:15:20,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2025-01-09 13:15:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:20,390 INFO L225 Difference]: With dead ends: 192 [2025-01-09 13:15:20,390 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 13:15:20,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:15:20,391 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 91 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:20,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 193 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:15:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 13:15:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2025-01-09 13:15:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:15:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2025-01-09 13:15:20,432 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 111 [2025-01-09 13:15:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:20,433 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2025-01-09 13:15:20,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2025-01-09 13:15:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 13:15:20,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:20,437 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:20,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:15:20,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:20,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:20,438 INFO L85 PathProgramCache]: Analyzing trace with hash 694000857, now seen corresponding path program 1 times [2025-01-09 13:15:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:20,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917379412] [2025-01-09 13:15:20,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:20,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 13:15:20,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 13:15:20,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:20,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:15:20,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662413117] [2025-01-09 13:15:20,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:20,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:15:20,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:20,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:15:20,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:15:20,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 13:15:20,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 13:15:20,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:20,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:15:20,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:15:20,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 13:15:20,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 13:15:20,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:20,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:15:20,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:15:20,649 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:15:20,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:15:20,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:15:20,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:15:20,855 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 13:15:20,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:15:20,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:15:20 BoogieIcfgContainer [2025-01-09 13:15:20,918 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:15:20,919 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:15:20,919 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:15:20,919 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:15:20,919 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:17" (3/4) ... [2025-01-09 13:15:20,925 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:15:20,926 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:15:20,927 INFO L158 Benchmark]: Toolchain (without parser) took 3884.49ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 97.9MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:15:20,927 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:15:20,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.43ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 111.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:15:20,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.62ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 109.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:15:20,927 INFO L158 Benchmark]: Boogie Preprocessor took 30.25ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:15:20,927 INFO L158 Benchmark]: RCFGBuilder took 458.91ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 89.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:15:20,928 INFO L158 Benchmark]: TraceAbstraction took 3128.03ms. Allocated memory is still 167.8MB. Free memory was 88.4MB in the beginning and 97.9MB in the end (delta: -9.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:15:20,928 INFO L158 Benchmark]: Witness Printer took 7.57ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 97.9MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:15:20,929 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.32ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.43ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 111.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.62ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 109.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.25ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 458.91ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 89.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3128.03ms. Allocated memory is still 167.8MB. Free memory was 88.4MB in the beginning and 97.9MB in the end (delta: -9.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 7.57ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 97.9MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of bitwiseOr at line 99, overapproximation of bitwiseOr at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_6 = 32; [L24] signed short int var_1_7 = 18477; [L25] signed short int var_1_8 = 5; [L26] float var_1_9 = 100.8; [L27] unsigned long int var_1_10 = 256; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 10; [L30] unsigned long int var_1_13 = 1879106797; [L31] unsigned long int var_1_14 = 1581421231; [L32] signed long int var_1_15 = -32; [L33] unsigned long int last_1_var_1_10 = 256; [L34] signed long int last_1_var_1_15 = -32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L103] isInitial = 1 [L104] FCALL initially() [L105] int k_loop; [L106] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L106] COND TRUE k_loop < 1 [L107] CALL updateLastVariables() [L95] last_1_var_1_10 = var_1_10 [L96] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_6 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L72] var_1_7 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L73] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L75] var_1_8 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L77] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L77] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L78] var_1_9 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L80] var_1_11 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L81] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L82] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L82] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L87] var_1_13 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L88] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L89] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L89] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L90] var_1_14 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_14 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L91] RET assume_abort_if_not(var_1_14 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L92] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L92] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L108] RET updateVariables() [L109] CALL step() [L38] unsigned long int stepLocal_1 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L39] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L39] unsigned long int stepLocal_0 = last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))); [L40] COND FALSE !(stepLocal_0 != last_1_var_1_10) [L45] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L47] signed short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L48] COND FALSE !(\read(var_1_11)) [L55] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L57] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L58] COND FALSE !(var_1_1 <= var_1_9) [L65] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L109] RET step() [L110] CALL, EXPR property() [L99] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L99-L100] return ((((last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))) != last_1_var_1_10) ? ((last_1_var_1_10 == (var_1_6 - (var_1_7 - var_1_8))) ? (var_1_1 == ((float) var_1_9)) : 1) : (var_1_1 == ((float) var_1_9))) && (var_1_11 ? (((var_1_7 % var_1_12) >= var_1_6) ? (var_1_10 == ((unsigned long int) ((var_1_13 + var_1_14) - var_1_7))) : (var_1_10 == ((unsigned long int) var_1_12))) : (var_1_10 == ((unsigned long int) var_1_7)))) && ((var_1_1 <= var_1_9) ? ((var_1_10 > (last_1_var_1_15 + (var_1_10 + var_1_7))) ? (var_1_15 == ((signed long int) var_1_7)) : (var_1_15 == ((signed long int) -5))) : (var_1_15 == ((signed long int) var_1_7))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 734 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 442 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 292 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 1284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2370/2400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 13:15:20,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.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 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:15:22,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:15:22,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:15:22,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:15:22,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:15:22,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:15:22,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:15:22,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:15:22,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:15:22,954 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:15:22,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:15:22,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:15:22,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:15:22,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:15:22,957 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:15:22,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:15:22,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:15:22,957 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:15:22,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:15:22,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:22,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:22,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:22,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:15:22,959 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:15:22,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:15:22,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:15:22,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:15:22,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:15:22,960 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2025-01-09 13:15:23,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:15:23,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:15:23,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:15:23,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:15:23,254 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:15:23,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-01-09 13:15:24,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9f4e132c/2dfa0999d91748f2b0e05b157959a576/FLAG126d34924 [2025-01-09 13:15:24,637 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:15:24,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-01-09 13:15:24,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9f4e132c/2dfa0999d91748f2b0e05b157959a576/FLAG126d34924 [2025-01-09 13:15:25,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9f4e132c/2dfa0999d91748f2b0e05b157959a576 [2025-01-09 13:15:25,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:15:25,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:15:25,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:25,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:15:25,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:15:25,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e243b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25, skipping insertion in model container [2025-01-09 13:15:25,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:15:25,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-01-09 13:15:25,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:25,159 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:15:25,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-01-09 13:15:25,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:25,192 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:15:25,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25 WrapperNode [2025-01-09 13:15:25,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:25,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:25,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:15:25,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:15:25,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,218 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-01-09 13:15:25,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:25,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:15:25,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:15:25,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:15:25,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,251 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:15:25,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:15:25,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:15:25,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:15:25,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:15:25,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (1/1) ... [2025-01-09 13:15:25,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:25,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:25,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:15:25,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:15:25,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:15:25,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:15:25,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:15:25,326 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:15:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:15:25,394 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:15:25,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:15:25,640 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 13:15:25,641 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:15:25,647 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:15:25,647 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:15:25,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:25 BoogieIcfgContainer [2025-01-09 13:15:25,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:15:25,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:15:25,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:15:25,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:15:25,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:15:25" (1/3) ... [2025-01-09 13:15:25,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34419d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:15:25, skipping insertion in model container [2025-01-09 13:15:25,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:25" (2/3) ... [2025-01-09 13:15:25,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34419d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:15:25, skipping insertion in model container [2025-01-09 13:15:25,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:25" (3/3) ... [2025-01-09 13:15:25,655 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-01-09 13:15:25,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:15:25,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:15:25,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:15:25,725 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;@cf637d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:15:25,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:15:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:15:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 13:15:25,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:25,739 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:25,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:25,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1148378786, now seen corresponding path program 1 times [2025-01-09 13:15:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:15:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322355842] [2025-01-09 13:15:25,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:25,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:15:25,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:15:25,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:15:25,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 13:15:25,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 13:15:25,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 13:15:25,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:25,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:25,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:15:25,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-01-09 13:15:25,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:15:25,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:15:25,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322355842] [2025-01-09 13:15:25,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322355842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:25,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:25,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:15:25,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779924066] [2025-01-09 13:15:25,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:25,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:15:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:15:25,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:15:25,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:15:25,997 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:15:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:26,015 INFO L93 Difference]: Finished difference Result 97 states and 159 transitions. [2025-01-09 13:15:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:15:26,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-01-09 13:15:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:26,021 INFO L225 Difference]: With dead ends: 97 [2025-01-09 13:15:26,021 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 13:15:26,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:15:26,025 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:26,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:15:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 13:15:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-09 13:15:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:15:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-01-09 13:15:26,054 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 102 [2025-01-09 13:15:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:26,056 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-01-09 13:15:26,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:15:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-01-09 13:15:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 13:15:26,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:26,058 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:26,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:15:26,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:15:26,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:26,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2116074530, now seen corresponding path program 1 times [2025-01-09 13:15:26,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:15:26,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988309830] [2025-01-09 13:15:26,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:26,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:15:26,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:15:26,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:15:26,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 13:15:26,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 13:15:26,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 13:15:26,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:26,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:26,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:15:26,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:15:27,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:15:27,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:15:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988309830] [2025-01-09 13:15:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988309830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:15:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329989643] [2025-01-09 13:15:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:27,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:15:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:15:27,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:15:27,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:15:27,024 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:27,262 INFO L93 Difference]: Finished difference Result 136 states and 199 transitions. [2025-01-09 13:15:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:15:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2025-01-09 13:15:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:27,267 INFO L225 Difference]: With dead ends: 136 [2025-01-09 13:15:27,268 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 13:15:27,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:15:27,268 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:27,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 204 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:15:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 13:15:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2025-01-09 13:15:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:15:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2025-01-09 13:15:27,294 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 102 [2025-01-09 13:15:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:27,294 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2025-01-09 13:15:27,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2025-01-09 13:15:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 13:15:27,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:27,297 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:27,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 13:15:27,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:15:27,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:27,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1569693629, now seen corresponding path program 1 times [2025-01-09 13:15:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:15:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462056056] [2025-01-09 13:15:27,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:27,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:15:27,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:15:27,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:15:27,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 13:15:27,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 13:15:27,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 13:15:27,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:27,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:27,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:15:27,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 252 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-01-09 13:15:28,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:15:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 13:15:28,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:15:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462056056] [2025-01-09 13:15:28,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462056056] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:15:28,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:15:28,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-09 13:15:28,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236456831] [2025-01-09 13:15:28,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:15:28,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:15:28,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:15:28,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:15:28,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:15:28,670 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-01-09 13:15:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:29,542 INFO L93 Difference]: Finished difference Result 192 states and 260 transitions. [2025-01-09 13:15:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:15:29,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 103 [2025-01-09 13:15:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:29,546 INFO L225 Difference]: With dead ends: 192 [2025-01-09 13:15:29,546 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 13:15:29,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2025-01-09 13:15:29,547 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 145 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:29,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 178 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:15:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 13:15:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2025-01-09 13:15:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 states have internal predecessors, (78), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:15:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2025-01-09 13:15:29,571 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 103 [2025-01-09 13:15:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:29,572 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2025-01-09 13:15:29,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-01-09 13:15:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2025-01-09 13:15:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 13:15:29,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:29,575 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:29,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 13:15:29,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:15:29,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:29,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash -889635259, now seen corresponding path program 1 times [2025-01-09 13:15:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:15:29,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971166693] [2025-01-09 13:15:29,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:29,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:15:29,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:15:29,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:15:29,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 13:15:29,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 13:15:29,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 13:15:29,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:29,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:29,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 13:15:29,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:15:35,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:15:35,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:15:35,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971166693] [2025-01-09 13:15:35,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971166693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:35,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:35,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:15:35,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157265596] [2025-01-09 13:15:35,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:35,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:15:35,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:15:35,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:15:35,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:15:35,026 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:35,657 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2025-01-09 13:15:35,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:15:35,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-01-09 13:15:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:35,662 INFO L225 Difference]: With dead ends: 162 [2025-01-09 13:15:35,662 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 13:15:35,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:15:35,663 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 74 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:35,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 360 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:15:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 13:15:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121. [2025-01-09 13:15:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 77 states have internal predecessors, (89), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:15:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 165 transitions. [2025-01-09 13:15:35,684 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 165 transitions. Word has length 103 [2025-01-09 13:15:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:35,684 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 165 transitions. [2025-01-09 13:15:35,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 165 transitions. [2025-01-09 13:15:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 13:15:35,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:35,685 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:35,692 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 (5)] Ended with exit code 0 [2025-01-09 13:15:35,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:15:35,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:35,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:35,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1651422544, now seen corresponding path program 1 times [2025-01-09 13:15:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:15:35,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709216958] [2025-01-09 13:15:35,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:35,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:15:35,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:15:35,889 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:15:35,889 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 (6)] Waiting until timeout for monitored process [2025-01-09 13:15:35,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 13:15:35,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 13:15:35,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:35,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:35,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:15:35,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-09 13:15:36,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:15:36,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:15:36,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709216958] [2025-01-09 13:15:36,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709216958] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:15:36,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1784397556] [2025-01-09 13:15:36,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:36,509 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:15:36,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:15:36,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 13:15:36,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 13:15:36,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 13:15:36,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 13:15:36,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:36,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:36,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 13:15:36,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:16:23,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:16:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1784397556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:23,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:16:23,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-01-09 13:16:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282214032] [2025-01-09 13:16:23,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:23,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:16:23,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:16:23,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:16:23,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-01-09 13:16:23,180 INFO L87 Difference]: Start difference. First operand 121 states and 165 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:16:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:24,311 INFO L93 Difference]: Finished difference Result 270 states and 361 transitions. [2025-01-09 13:16:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 13:16:24,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-01-09 13:16:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:24,317 INFO L225 Difference]: With dead ends: 270 [2025-01-09 13:16:24,317 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 13:16:24,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-01-09 13:16:24,319 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 119 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:24,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 501 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 13:16:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 13:16:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 173. [2025-01-09 13:16:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 109 states have internal predecessors, (123), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 13:16:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 231 transitions. [2025-01-09 13:16:24,339 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 231 transitions. Word has length 104 [2025-01-09 13:16:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:24,340 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 231 transitions. [2025-01-09 13:16:24,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:16:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 231 transitions. [2025-01-09 13:16:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 13:16:24,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:24,341 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:16:24,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-01-09 13:16:24,547 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 (6)] Ended with exit code 0 [2025-01-09 13:16:24,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:16:24,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:24,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1649575502, now seen corresponding path program 1 times [2025-01-09 13:16:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:16:24,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090946387] [2025-01-09 13:16:24,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:24,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:16:24,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:16:24,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:16:24,747 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 (8)] Waiting until timeout for monitored process [2025-01-09 13:16:24,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 13:16:24,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 13:16:24,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:24,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:24,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 13:16:24,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-09 13:16:30,737 INFO L312 TraceCheckSpWp]: Computing backward predicates...