./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.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_variablewrapping_normal_file-73.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 f92f77375779269f33d6d08378e9440b45a9cd84382d3de78a8a10074b76e7bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:14:00,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:14:00,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:14:00,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:14:00,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:14:00,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:14:00,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:14:00,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:14:00,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:14:00,681 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:14:00,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:14:00,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:14:00,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:14:00,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:14:00,682 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:14:00,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:14:00,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:14:00,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:14:00,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:14:00,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:14:00,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:14:00,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:14:00,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:14:00,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:00,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:00,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:00,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:14:00,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:14:00,686 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 -> f92f77375779269f33d6d08378e9440b45a9cd84382d3de78a8a10074b76e7bc [2025-01-09 15:14:00,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:14:00,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:14:00,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:14:00,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:14:00,998 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:14:00,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i [2025-01-09 15:14:02,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58f9b3917/2b831d7e2f6e4bc7a08d8faa9e5fbe17/FLAG146ba9f16 [2025-01-09 15:14:02,584 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:14:02,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i [2025-01-09 15:14:02,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58f9b3917/2b831d7e2f6e4bc7a08d8faa9e5fbe17/FLAG146ba9f16 [2025-01-09 15:14:02,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58f9b3917/2b831d7e2f6e4bc7a08d8faa9e5fbe17 [2025-01-09 15:14:02,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:14:02,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:14:02,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:02,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:14:02,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:14:02,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:02,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d380c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02, skipping insertion in model container [2025-01-09 15:14:02,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:02,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:14:02,799 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_variablewrapping_normal_file-73.i[913,926] [2025-01-09 15:14:02,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:02,868 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:14:02,876 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_variablewrapping_normal_file-73.i[913,926] [2025-01-09 15:14:02,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:02,925 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:14:02,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02 WrapperNode [2025-01-09 15:14:02,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:02,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:02,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:14:02,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:14:02,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:02,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:02,972 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-01-09 15:14:02,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:02,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:14:02,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:14:02,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:14:02,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:02,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:02,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:03,000 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 15:14:03,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:03,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:03,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:03,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:03,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:03,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:03,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:03,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:14:03,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:14:03,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:14:03,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:14:03,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (1/1) ... [2025-01-09 15:14:03,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:03,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:14:03,061 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 15:14:03,065 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 15:14:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:14:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:14:03,089 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:14:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:14:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:14:03,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:14:03,164 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:14:03,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:14:03,396 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:14:03,396 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:14:03,406 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:14:03,406 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:14:03,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:03 BoogieIcfgContainer [2025-01-09 15:14:03,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:14:03,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:14:03,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:14:03,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:14:03,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:14:02" (1/3) ... [2025-01-09 15:14:03,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b4634a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:03, skipping insertion in model container [2025-01-09 15:14:03,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:02" (2/3) ... [2025-01-09 15:14:03,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b4634a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:03, skipping insertion in model container [2025-01-09 15:14:03,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:03" (3/3) ... [2025-01-09 15:14:03,416 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-73.i [2025-01-09 15:14:03,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:14:03,435 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-73.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:14:03,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:14:03,514 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;@f92af65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:14:03,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:14:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 15:14:03,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:03,529 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:03,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:03,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1914063491, now seen corresponding path program 1 times [2025-01-09 15:14:03,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:03,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615186062] [2025-01-09 15:14:03,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:03,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 15:14:03,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 15:14:03,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:03,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:14:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615186062] [2025-01-09 15:14:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615186062] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:14:03,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116039773] [2025-01-09 15:14:03,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:03,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:14:03,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:14:03,782 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 15:14:03,783 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 15:14:03,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 15:14:03,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 15:14:03,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:03,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:03,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:14:03,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:14:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:14:03,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:14:03,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116039773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:03,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:14:03,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:14:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672955835] [2025-01-09 15:14:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:03,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:14:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:03,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:14:03,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:14:03,993 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:14:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:04,013 INFO L93 Difference]: Finished difference Result 98 states and 160 transitions. [2025-01-09 15:14:04,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:14:04,015 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2025-01-09 15:14:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:04,020 INFO L225 Difference]: With dead ends: 98 [2025-01-09 15:14:04,020 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 15:14:04,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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 15:14:04,025 INFO L435 NwaCegarLoop]: 70 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, 70 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 15:14:04,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:14:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 15:14:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 15:14:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-01-09 15:14:04,057 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 99 [2025-01-09 15:14:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:04,057 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-01-09 15:14:04,057 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:14:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-01-09 15:14:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 15:14:04,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:04,061 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:04,069 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 15:14:04,265 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 15:14:04,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1817969783, now seen corresponding path program 1 times [2025-01-09 15:14:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822471241] [2025-01-09 15:14:04,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:04,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:04,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 15:14:04,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 15:14:04,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:04,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:14:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822471241] [2025-01-09 15:14:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822471241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:04,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:04,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:14:04,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329225242] [2025-01-09 15:14:04,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:04,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:14:04,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:04,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:14:04,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:14:04,798 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:04,929 INFO L93 Difference]: Finished difference Result 128 states and 186 transitions. [2025-01-09 15:14:04,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:14:04,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-01-09 15:14:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:04,931 INFO L225 Difference]: With dead ends: 128 [2025-01-09 15:14:04,931 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 15:14:04,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:14:04,932 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:04,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 190 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:14:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 15:14:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2025-01-09 15:14:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-01-09 15:14:04,949 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 99 [2025-01-09 15:14:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:04,950 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-01-09 15:14:04,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-01-09 15:14:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:14:04,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:04,952 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:04,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:14:04,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:04,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash 765103180, now seen corresponding path program 1 times [2025-01-09 15:14:04,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:04,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619097447] [2025-01-09 15:14:04,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:04,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:04,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:14:04,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:14:04,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:04,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:14:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619097447] [2025-01-09 15:14:05,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619097447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:05,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:05,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:14:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757520867] [2025-01-09 15:14:05,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:05,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:14:05,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:05,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:14:05,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:14:05,070 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:05,104 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2025-01-09 15:14:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:14:05,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-01-09 15:14:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:05,108 INFO L225 Difference]: With dead ends: 110 [2025-01-09 15:14:05,108 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 15:14:05,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:14:05,110 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:05,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:14:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 15:14:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2025-01-09 15:14:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2025-01-09 15:14:05,121 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 100 [2025-01-09 15:14:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:05,123 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2025-01-09 15:14:05,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2025-01-09 15:14:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:14:05,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:05,125 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:05,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:14:05,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:05,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash 822361482, now seen corresponding path program 1 times [2025-01-09 15:14:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:05,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656394477] [2025-01-09 15:14:05,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:05,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:14:05,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:14:05,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:05,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:14:05,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:14:05,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:14:05,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:14:05,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:05,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:14:05,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:14:05,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:14:05,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:14:05,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:14:05,303 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 15:14:05,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:14:05,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:14:05 BoogieIcfgContainer [2025-01-09 15:14:05,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:14:05,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:14:05,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:14:05,379 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:14:05,380 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:03" (3/4) ... [2025-01-09 15:14:05,383 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:14:05,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:14:05,384 INFO L158 Benchmark]: Toolchain (without parser) took 2758.13ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 47.0MB in the end (delta: 75.4MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2025-01-09 15:14:05,385 INFO L158 Benchmark]: CDTParser took 1.17ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:14:05,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.52ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 109.5MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:14:05,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.51ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 106.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:14:05,386 INFO L158 Benchmark]: Boogie Preprocessor took 50.56ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:14:05,387 INFO L158 Benchmark]: RCFGBuilder took 381.86ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 87.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:14:05,387 INFO L158 Benchmark]: TraceAbstraction took 1969.39ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 47.0MB in the end (delta: 39.7MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2025-01-09 15:14:05,387 INFO L158 Benchmark]: Witness Printer took 4.87ms. Allocated memory is still 167.8MB. Free memory was 47.0MB in the beginning and 47.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:14:05,389 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.52ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 109.5MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.51ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 106.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.56ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 381.86ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 87.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1969.39ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 47.0MB in the end (delta: 39.7MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * Witness Printer took 4.87ms. Allocated memory is still 167.8MB. Free memory was 47.0MB in the beginning and 47.0MB 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 92, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] float var_1_12 = 15.75; [L29] float var_1_13 = 1.6; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] float var_1_16 = 16.5; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] float last_1_var_1_12 = 15.75; VAL [isInitial=0, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L105] isInitial = 1 [L106] FCALL initially() [L108] CALL updateLastVariables() [L98] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L84] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L86] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L87] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L88] var_1_15 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L90] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L91] var_1_16 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L92] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L93] var_1_18 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L94] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L95] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L48] COND FALSE !(var_1_19 > var_1_9) [L59] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=63/4, stepLocal_0=0, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] [L69] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((float) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((float) (var_1_13 - var_1_16))) : (var_1_12 == ((float) var_1_16)))) : (var_1_12 == ((float) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=106, var_1_13=106, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=105, var_1_6=1, var_1_7=105, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 383 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 249 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 42 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1652/1680 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 15:14:05,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.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 f92f77375779269f33d6d08378e9440b45a9cd84382d3de78a8a10074b76e7bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:14:07,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:14:07,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:14:07,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:14:07,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:14:07,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:14:07,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:14:07,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:14:07,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:14:07,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:14:07,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:14:07,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:14:07,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:14:07,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:14:07,795 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:14:07,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:14:07,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:14:07,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:14:07,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:14:07,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:14:07,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:07,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:07,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:07,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:14:07,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:14:07,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:14:07,799 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 -> f92f77375779269f33d6d08378e9440b45a9cd84382d3de78a8a10074b76e7bc [2025-01-09 15:14:08,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:14:08,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:14:08,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:14:08,116 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:14:08,116 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:14:08,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i [2025-01-09 15:14:09,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9037ac92/914308fb89014c748960b5b540f20def/FLAG2e9c4dd4c [2025-01-09 15:14:09,689 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:14:09,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i [2025-01-09 15:14:09,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9037ac92/914308fb89014c748960b5b540f20def/FLAG2e9c4dd4c [2025-01-09 15:14:09,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9037ac92/914308fb89014c748960b5b540f20def [2025-01-09 15:14:09,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:14:09,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:14:09,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:09,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:14:09,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:14:09,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:09" (1/1) ... [2025-01-09 15:14:09,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3c6781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:09, skipping insertion in model container [2025-01-09 15:14:09,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:09" (1/1) ... [2025-01-09 15:14:09,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:14:09,888 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_variablewrapping_normal_file-73.i[913,926] [2025-01-09 15:14:09,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:09,970 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:14:09,982 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_variablewrapping_normal_file-73.i[913,926] [2025-01-09 15:14:10,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:10,033 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:14:10,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10 WrapperNode [2025-01-09 15:14:10,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:10,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:10,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:14:10,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:14:10,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,082 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-01-09 15:14:10,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:10,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:14:10,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:14:10,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:14:10,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,107 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 15:14:10,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:14:10,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:14:10,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:14:10,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:14:10,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (1/1) ... [2025-01-09 15:14:10,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:10,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:14:10,170 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 15:14:10,173 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 15:14:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:14:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:14:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:14:10,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:14:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:14:10,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:14:10,259 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:14:10,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:14:12,835 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:14:12,835 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:14:12,846 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:14:12,846 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:14:12,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:12 BoogieIcfgContainer [2025-01-09 15:14:12,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:14:12,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:14:12,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:14:12,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:14:12,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:14:09" (1/3) ... [2025-01-09 15:14:12,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c561ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:12, skipping insertion in model container [2025-01-09 15:14:12,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:10" (2/3) ... [2025-01-09 15:14:12,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c561ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:12, skipping insertion in model container [2025-01-09 15:14:12,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:12" (3/3) ... [2025-01-09 15:14:12,860 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-73.i [2025-01-09 15:14:12,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:14:12,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-73.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:14:12,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:14:12,932 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;@171ac67c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:14:12,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:14:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 15:14:12,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:12,944 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:12,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:12,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1914063491, now seen corresponding path program 1 times [2025-01-09 15:14:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:14:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922764227] [2025-01-09 15:14:12,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:12,957 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 15:14:12,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:14:12,960 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 15:14:12,961 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 15:14:13,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 15:14:13,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 15:14:13,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:13,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:13,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:14:13,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:14:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 15:14:13,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:14:13,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:14:13,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922764227] [2025-01-09 15:14:13,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922764227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:13,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:13,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:14:13,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283961143] [2025-01-09 15:14:13,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:13,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:14:13,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:14:13,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:14:13,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:14:13,302 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:14:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:13,331 INFO L93 Difference]: Finished difference Result 98 states and 160 transitions. [2025-01-09 15:14:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:14:13,335 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2025-01-09 15:14:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:13,341 INFO L225 Difference]: With dead ends: 98 [2025-01-09 15:14:13,342 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 15:14:13,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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 15:14:13,350 INFO L435 NwaCegarLoop]: 70 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, 70 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 15:14:13,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:14:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 15:14:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 15:14:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-01-09 15:14:13,421 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 99 [2025-01-09 15:14:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:13,421 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-01-09 15:14:13,421 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:14:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-01-09 15:14:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 15:14:13,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:13,424 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:13,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:14:13,626 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 15:14:13,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:13,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1817969783, now seen corresponding path program 1 times [2025-01-09 15:14:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:14:13,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038664176] [2025-01-09 15:14:13,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:13,628 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 15:14:13,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:14:13,630 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 15:14:13,631 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 15:14:13,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 15:14:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 15:14:13,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:13,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:13,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:14:13,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:14:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:14:13,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:14:13,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:14:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038664176] [2025-01-09 15:14:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038664176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:13,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:13,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:14:13,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421481354] [2025-01-09 15:14:13,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:13,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:14:13,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:14:13,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:14:13,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:14:13,992 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:16,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:14:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:16,790 INFO L93 Difference]: Finished difference Result 128 states and 186 transitions. [2025-01-09 15:14:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:14:16,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-01-09 15:14:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:16,793 INFO L225 Difference]: With dead ends: 128 [2025-01-09 15:14:16,793 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 15:14:16,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 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 15:14:16,794 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 62 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:16,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 234 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 15:14:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 15:14:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2025-01-09 15:14:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-01-09 15:14:16,802 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 99 [2025-01-09 15:14:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:16,804 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-01-09 15:14:16,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-01-09 15:14:16,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:14:16,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:16,806 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:16,814 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 15:14:17,007 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 15:14:17,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:17,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash 765103180, now seen corresponding path program 1 times [2025-01-09 15:14:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:14:17,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009539929] [2025-01-09 15:14:17,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:17,008 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 15:14:17,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:14:17,011 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 15:14:17,012 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 15:14:17,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:14:17,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:14:17,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:17,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:17,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:14:17,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:14:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:14:17,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:14:17,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:14:17,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009539929] [2025-01-09 15:14:17,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009539929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:17,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:14:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161121343] [2025-01-09 15:14:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:17,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:14:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:14:17,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:14:17,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:14:17,274 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:18,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:14:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:18,979 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2025-01-09 15:14:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:14:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-01-09 15:14:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:18,998 INFO L225 Difference]: With dead ends: 110 [2025-01-09 15:14:18,998 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 15:14:18,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:14:18,999 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:18,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 122 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 15:14:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 15:14:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2025-01-09 15:14:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2025-01-09 15:14:19,009 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 100 [2025-01-09 15:14:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:19,010 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2025-01-09 15:14:19,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2025-01-09 15:14:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:14:19,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:19,012 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:19,020 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 15:14:19,212 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 15:14:19,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:19,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash 822361482, now seen corresponding path program 1 times [2025-01-09 15:14:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:14:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941689100] [2025-01-09 15:14:19,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:19,214 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 15:14:19,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:14:19,216 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 15:14:19,217 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 15:14:19,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:14:19,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:14:19,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:19,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:19,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:14:19,439 INFO L279 TraceCheckSpWp]: Computing forward predicates...