./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-20.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_wrapper-s_file-20.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 4a7298dd3af0d9101e678a75f8643535906386a3d9e43aefb3c84d3566870e8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:55:45,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:55:45,574 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:55:45,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:55:45,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:55:45,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:55:45,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:55:45,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:55:45,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:55:45,594 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:55:45,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:55:45,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:55:45,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:55:45,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:55:45,595 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:55:45,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:55:45,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:55:45,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:55:45,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:55:45,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:55:45,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:55:45,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:55:45,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:55:45,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:55:45,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:55:45,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:55:45,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:55:45,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:55:45,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:55:45,599 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 -> 4a7298dd3af0d9101e678a75f8643535906386a3d9e43aefb3c84d3566870e8d [2025-01-09 15:55:45,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:55:45,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:55:45,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:55:45,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:55:45,822 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:55:45,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-20.i [2025-01-09 15:55:46,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3b1f0a6a/8b9e91e3850a493cb710a135c47ea8e6/FLAGc67926b69 [2025-01-09 15:55:47,189 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:55:47,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-20.i [2025-01-09 15:55:47,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3b1f0a6a/8b9e91e3850a493cb710a135c47ea8e6/FLAGc67926b69 [2025-01-09 15:55:47,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3b1f0a6a/8b9e91e3850a493cb710a135c47ea8e6 [2025-01-09 15:55:47,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:55:47,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:55:47,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:55:47,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:55:47,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:55:47,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73abb723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47, skipping insertion in model container [2025-01-09 15:55:47,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:55:47,662 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_wrapper-s_file-20.i[916,929] [2025-01-09 15:55:47,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:55:47,724 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:55:47,731 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_wrapper-s_file-20.i[916,929] [2025-01-09 15:55:47,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:55:47,775 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:55:47,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47 WrapperNode [2025-01-09 15:55:47,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:55:47,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:55:47,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:55:47,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:55:47,780 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:55:47" (1/1) ... [2025-01-09 15:55:47,787 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:55:47" (1/1) ... [2025-01-09 15:55:47,811 INFO L138 Inliner]: procedures = 30, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2025-01-09 15:55:47,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:55:47,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:55:47,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:55:47,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:55:47,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,825 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 15:55:47,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:55:47,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:55:47,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:55:47,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:55:47,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (1/1) ... [2025-01-09 15:55:47,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:55:47,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:55:47,889 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:55:47,891 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:55:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:55:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 15:55:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 15:55:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 15:55:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 15:55:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 15:55:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 15:55:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:55:47,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:55:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 15:55:47,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:55:47,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:55:47,999 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:55:48,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:55:48,371 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-01-09 15:55:48,371 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:55:48,378 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:55:48,378 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:55:48,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:48 BoogieIcfgContainer [2025-01-09 15:55:48,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:55:48,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:55:48,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:55:48,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:55:48,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:55:47" (1/3) ... [2025-01-09 15:55:48,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444e9ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:48, skipping insertion in model container [2025-01-09 15:55:48,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:47" (2/3) ... [2025-01-09 15:55:48,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444e9ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:48, skipping insertion in model container [2025-01-09 15:55:48,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:48" (3/3) ... [2025-01-09 15:55:48,385 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-20.i [2025-01-09 15:55:48,394 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:55:48,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-20.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:55:48,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:55:48,451 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;@6da806ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:55:48,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:55:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:55:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:55:48,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:48,462 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:48,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:48,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash 544688448, now seen corresponding path program 1 times [2025-01-09 15:55:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:48,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370326138] [2025-01-09 15:55:48,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:48,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:55:48,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:55:48,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:48,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:55:48,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370326138] [2025-01-09 15:55:48,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370326138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:55:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370254071] [2025-01-09 15:55:48,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:48,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:55:48,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:55:48,719 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:55:48,720 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:55:48,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:55:48,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:55:48,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:48,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:48,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:55:48,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:55:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:55:48,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:55:48,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370254071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:48,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:55:48,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:55:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324061741] [2025-01-09 15:55:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:55:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:48,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:55:48,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:55:48,981 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:55:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:49,008 INFO L93 Difference]: Finished difference Result 218 states and 344 transitions. [2025-01-09 15:55:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:55:49,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-01-09 15:55:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:49,016 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:55:49,017 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:55:49,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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:55:49,022 INFO L435 NwaCegarLoop]: 156 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, 156 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:55:49,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:55:49,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:55:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 15:55:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:55:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-01-09 15:55:49,053 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 152 [2025-01-09 15:55:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:49,053 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-01-09 15:55:49,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:55:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-01-09 15:55:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:55:49,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:49,055 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:49,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:55:49,256 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:55:49,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:49,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1021282198, now seen corresponding path program 1 times [2025-01-09 15:55:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91827327] [2025-01-09 15:55:49,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:49,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:55:49,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:55:49,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:49,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:55:49,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:55:49,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:55:49,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:55:49,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:49,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:55:49,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:55:49,596 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:55:49,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:55:49,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:55:49,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 15:55:49,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:55:49,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:55:49 BoogieIcfgContainer [2025-01-09 15:55:49,661 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:55:49,661 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:55:49,661 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:55:49,662 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:55:49,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:48" (3/4) ... [2025-01-09 15:55:49,667 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:55:49,672 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:55:49,672 INFO L158 Benchmark]: Toolchain (without parser) took 2133.87ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 59.7MB in the end (delta: 52.9MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-01-09 15:55:49,673 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:55:49,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.84ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 95.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:55:49,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.18ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:55:49,673 INFO L158 Benchmark]: Boogie Preprocessor took 45.11ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 88.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:55:49,673 INFO L158 Benchmark]: RCFGBuilder took 521.12ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 57.5MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:55:49,674 INFO L158 Benchmark]: TraceAbstraction took 1281.17ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 59.7MB in the end (delta: -2.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2025-01-09 15:55:49,674 INFO L158 Benchmark]: Witness Printer took 10.53ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 59.7MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:55:49,675 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.84ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 95.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.18ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.11ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 88.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 521.12ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 57.5MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1281.17ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 59.7MB in the end (delta: -2.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Witness Printer took 10.53ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 59.7MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticFLOAToperation at line 63. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 0.6, 0, 0.0, 2.95, 8.5, 999999999999.4, 10.2, 4.6, 256, 0, 3724367395, 25, 1, 1, 128, 100 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L128] isInitial = 1 [L129] FCALL initially() [L131] FCALL updateLastVariables() [L132] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR (WrapperStruct00.var_1_3 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_5 [L97] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_5 [L97] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L99] EXPR WrapperStruct00.var_1_6 [L99] EXPR WrapperStruct00.var_1_6 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_6 [L99] EXPR WrapperStruct00.var_1_6 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_6 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L106] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 3221225470) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 3221225470) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L132] RET updateVariables() [L133] CALL step() [L62] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L62] COND TRUE WrapperStruct00.var_1_2 [L63] EXPR WrapperStruct00.var_1_3 [L63] EXPR WrapperStruct00.var_1_4 [L63] EXPR WrapperStruct00.var_1_5 [L63] WrapperStruct00.var_1_1 = ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_4) - WrapperStruct00.var_1_5) [L67] EXPR WrapperStruct00.var_1_4 [L67] EXPR WrapperStruct00.var_1_3 [L67] EXPR WrapperStruct00.var_1_8 [L67] WrapperStruct00.var_1_7 = ((15.5 + WrapperStruct00.var_1_4) - (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8)) [L68] EXPR WrapperStruct00.var_1_13 [L68] unsigned long int stepLocal_2 = WrapperStruct00.var_1_13; [L69] signed long int stepLocal_1 = 5; [L70] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=5, stepLocal_2=2147483647] [L70] COND FALSE !(stepLocal_1 >= WrapperStruct00.var_1_11) [L81] EXPR WrapperStruct00.var_1_2 [L81] unsigned char stepLocal_0 = WrapperStruct00.var_1_2; [L82] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=257, stepLocal_2=2147483647] [L82] COND TRUE WrapperStruct00.var_1_10 || stepLocal_0 [L83] EXPR WrapperStruct00.var_1_11 [L83] EXPR WrapperStruct00.var_1_14 [L83] EXPR WrapperStruct00.var_1_14 [L83] WrapperStruct00.var_1_9 = ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_14) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L124] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_4) - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_6))) [L124] EXPR WrapperStruct00.var_1_1 [L124] EXPR WrapperStruct00.var_1_3 [L124] EXPR WrapperStruct00.var_1_4 [L124] EXPR WrapperStruct00.var_1_5 [L124] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_4) - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_4) - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_6)))) && (WrapperStruct00.var_1_7 == ((double) ((15.5 + WrapperStruct00.var_1_4) - (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8)))) [L124] EXPR WrapperStruct00.var_1_7 [L124] EXPR WrapperStruct00.var_1_4 [L124] EXPR WrapperStruct00.var_1_3 [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_4) - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_6)))) && (WrapperStruct00.var_1_7 == ((double) ((15.5 + WrapperStruct00.var_1_4) - (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_4) - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_6)))) && (WrapperStruct00.var_1_7 == ((double) ((15.5 + WrapperStruct00.var_1_4) - (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))))) && ((WrapperStruct00.var_1_10 || WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_9 == ((unsigned long int) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_9 == ((unsigned long int) (WrapperStruct00.var_1_14 + ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_4) - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_6)))) && (WrapperStruct00.var_1_7 == ((double) ((15.5 + WrapperStruct00.var_1_4) - (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))))) && ((WrapperStruct00.var_1_10 || WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_9 == ((unsigned long int) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_9 == ((unsigned long int) (WrapperStruct00.var_1_14 + ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))))))) && ((5 >= WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_1 >= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((unsigned char) (128 - 16))) : ((WrapperStruct00.var_1_13 >= ((((WrapperStruct00.var_1_12) < 0 ) ? -(WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)))) ? (WrapperStruct00.var_1_14 == ((unsigned char) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L124-L125] return (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_4) - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_6)))) && (WrapperStruct00.var_1_7 == ((double) ((15.5 + WrapperStruct00.var_1_4) - (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))))) && ((WrapperStruct00.var_1_10 || WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_9 == ((unsigned long int) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_9 == ((unsigned long int) (WrapperStruct00.var_1_14 + ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))))))) && ((5 >= WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_1 >= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((unsigned char) (128 - 16))) : ((WrapperStruct00.var_1_13 >= ((((WrapperStruct00.var_1_12) < 0 ) ? -(WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)))) ? (WrapperStruct00.var_1_14 == ((unsigned char) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)))) : 1) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 156 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 543 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 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:55:49,700 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_wrapper-s_file-20.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 4a7298dd3af0d9101e678a75f8643535906386a3d9e43aefb3c84d3566870e8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:55:51,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:55:51,798 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:55:51,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:55:51,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:55:51,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:55:51,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:55:51,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:55:51,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:55:51,823 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:55:51,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:55:51,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:55:51,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:55:51,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:55:51,824 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:55:51,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:55:51,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:55:51,824 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:55:51,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:55:51,825 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:55:51,826 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:55:51,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:55:51,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:55:51,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:55:51,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:55:51,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:55:51,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:55:51,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:55:51,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:55:51,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:55:51,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:55:51,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:55:51,827 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:55:51,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:55:51,827 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:55:51,827 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:55:51,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:55:51,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:55:51,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:55:51,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:55:51,827 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 -> 4a7298dd3af0d9101e678a75f8643535906386a3d9e43aefb3c84d3566870e8d [2025-01-09 15:55:52,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:55:52,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:55:52,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:55:52,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:55:52,056 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:55:52,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-20.i [2025-01-09 15:55:53,972 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15d265058/a1bc3ae7d88a4f329f965bcbf183dcdf/FLAGa1f5381d0 [2025-01-09 15:55:54,126 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:55:54,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-20.i [2025-01-09 15:55:54,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15d265058/a1bc3ae7d88a4f329f965bcbf183dcdf/FLAGa1f5381d0 [2025-01-09 15:55:54,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15d265058/a1bc3ae7d88a4f329f965bcbf183dcdf [2025-01-09 15:55:54,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:55:54,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:55:54,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:55:54,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:55:54,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:55:54,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db63ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54, skipping insertion in model container [2025-01-09 15:55:54,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:55:54,624 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_wrapper-s_file-20.i[916,929] [2025-01-09 15:55:54,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:55:54,667 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:55:54,673 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_wrapper-s_file-20.i[916,929] [2025-01-09 15:55:54,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:55:54,711 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:55:54,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54 WrapperNode [2025-01-09 15:55:54,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:55:54,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:55:54,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:55:54,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:55:54,717 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:55:54" (1/1) ... [2025-01-09 15:55:54,726 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:55:54" (1/1) ... [2025-01-09 15:55:54,747 INFO L138 Inliner]: procedures = 37, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2025-01-09 15:55:54,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:55:54,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:55:54,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:55:54,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:55:54,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,771 INFO L175 MemorySlicer]: Split 137 memory accesses to 2 slices as follows [2, 135]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 37 writes are split as follows [0, 37]. [2025-01-09 15:55:54,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:55:54,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:55:54,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:55:54,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:55:54,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (1/1) ... [2025-01-09 15:55:54,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:55:54,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:55:54,813 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:55:54,819 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:55:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:55:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:55:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:55:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 15:55:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 15:55:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:55:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:55:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 15:55:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 15:55:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:55:54,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:55:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 15:55:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 15:55:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:55:54,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:55:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:55:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:55:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:55:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:55:54,929 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:55:54,930 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:56:04,405 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-01-09 15:56:04,406 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:56:04,414 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:56:04,416 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:56:04,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:04 BoogieIcfgContainer [2025-01-09 15:56:04,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:56:04,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:56:04,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:56:04,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:56:04,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:55:54" (1/3) ... [2025-01-09 15:56:04,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c71152f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:04, skipping insertion in model container [2025-01-09 15:56:04,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:54" (2/3) ... [2025-01-09 15:56:04,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c71152f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:04, skipping insertion in model container [2025-01-09 15:56:04,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:04" (3/3) ... [2025-01-09 15:56:04,425 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-20.i [2025-01-09 15:56:04,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:56:04,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-20.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:56:04,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:56:04,490 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;@5d367fcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:56:04,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:56:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:56:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:56:04,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:04,512 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:04,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:04,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1315815283, now seen corresponding path program 1 times [2025-01-09 15:56:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:04,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111898940] [2025-01-09 15:56:04,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:04,529 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:56:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:04,534 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:56:04,537 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:56:04,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:56:05,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:56:05,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:05,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:05,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:56:05,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-09 15:56:05,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:05,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111898940] [2025-01-09 15:56:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111898940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:05,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:05,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:56:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81418121] [2025-01-09 15:56:05,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:05,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:56:05,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:05,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:56:05,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:56:05,303 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:56:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:05,321 INFO L93 Difference]: Finished difference Result 218 states and 344 transitions. [2025-01-09 15:56:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:56:05,322 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-01-09 15:56:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:05,326 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:56:05,326 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:56:05,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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:56:05,329 INFO L435 NwaCegarLoop]: 156 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, 156 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:56:05,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:56:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:56:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 15:56:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:56:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-01-09 15:56:05,353 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 152 [2025-01-09 15:56:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:05,353 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-01-09 15:56:05,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:56:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-01-09 15:56:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:56:05,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:05,356 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,376 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:56:05,560 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:56:05,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:05,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1413181367, now seen corresponding path program 1 times [2025-01-09 15:56:05,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:05,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82268713] [2025-01-09 15:56:05,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:05,562 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:56:05,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:05,563 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:56:05,575 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:56:05,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:56:06,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:56:06,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:06,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:06,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:56:06,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2025-01-09 15:56:06,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:06,243 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82268713] [2025-01-09 15:56:06,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82268713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:06,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:06,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:56:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866830681] [2025-01-09 15:56:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:06,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:56:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:06,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:56:06,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:56:06,249 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:56:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:06,300 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2025-01-09 15:56:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:56:06,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-01-09 15:56:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:06,302 INFO L225 Difference]: With dead ends: 217 [2025-01-09 15:56:06,302 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 15:56:06,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:56:06,303 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:06,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:56:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 15:56:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 15:56:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:56:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-01-09 15:56:06,310 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 152 [2025-01-09 15:56:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:06,311 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-01-09 15:56:06,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:56:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-01-09 15:56:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:56:06,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:06,313 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:06,331 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:56:06,517 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:56:06,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1842839673, now seen corresponding path program 1 times [2025-01-09 15:56:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:06,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228674167] [2025-01-09 15:56:06,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:06,519 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:56:06,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:06,521 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:56:06,522 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:56:06,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:56:07,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:56:07,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:07,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:07,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:56:07,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:07,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 43 [2025-01-09 15:56:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-01-09 15:56:07,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:07,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:07,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228674167] [2025-01-09 15:56:07,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228674167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:07,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:07,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:56:07,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905537421] [2025-01-09 15:56:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:07,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:07,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:07,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:07,544 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:56:09,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:14,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:17,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:22,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:22,725 INFO L93 Difference]: Finished difference Result 220 states and 314 transitions. [2025-01-09 15:56:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:56:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-01-09 15:56:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:22,728 INFO L225 Difference]: With dead ends: 220 [2025-01-09 15:56:22,728 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 15:56:22,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:56:22,729 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 141 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:22,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 417 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 1 Unknown, 0 Unchecked, 15.1s Time] [2025-01-09 15:56:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 15:56:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-01-09 15:56:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:56:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2025-01-09 15:56:22,735 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 152 [2025-01-09 15:56:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:22,735 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2025-01-09 15:56:22,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:56:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2025-01-09 15:56:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:56:22,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:22,737 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:22,757 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:56:22,938 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:56:22,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:22,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -418045345, now seen corresponding path program 1 times [2025-01-09 15:56:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298711346] [2025-01-09 15:56:22,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:22,942 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:56:22,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:22,945 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:56:22,946 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:56:23,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:56:23,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:56:23,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:23,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:23,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:56:23,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:23,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 15:56:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2025-01-09 15:56:23,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:23,798 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:23,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298711346] [2025-01-09 15:56:23,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298711346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:23,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:23,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:56:23,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021448161] [2025-01-09 15:56:23,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:23,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:23,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:23,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:23,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:23,800 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:56:28,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:33,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:35,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:36,023 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2025-01-09 15:56:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:56:36,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-01-09 15:56:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:36,024 INFO L225 Difference]: With dead ends: 219 [2025-01-09 15:56:36,024 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 15:56:36,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:56:36,025 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 134 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:36,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 412 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 1 Unknown, 0 Unchecked, 12.1s Time] [2025-01-09 15:56:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 15:56:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-01-09 15:56:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:56:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2025-01-09 15:56:36,031 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 154 [2025-01-09 15:56:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:36,031 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2025-01-09 15:56:36,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:56:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2025-01-09 15:56:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 15:56:36,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:36,033 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:36,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 15:56:36,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:36,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:36,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:36,237 INFO L85 PathProgramCache]: Analyzing trace with hash -533442953, now seen corresponding path program 1 times [2025-01-09 15:56:36,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:36,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944870334] [2025-01-09 15:56:36,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:36,238 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:56:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:36,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:36,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:56:36,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:56:36,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:56:36,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:36,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:36,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:56:36,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:37,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2025-01-09 15:56:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 12 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 15:56:37,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:56:37,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2025-01-09 15:56:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:56:37,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944870334] [2025-01-09 15:56:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944870334] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:56:37,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:56:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-01-09 15:56:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75899081] [2025-01-09 15:56:37,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:56:37,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:56:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:37,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:56:37,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:56:37,761 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2025-01-09 15:56:40,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:45,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:49,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:52,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:52,559 INFO L93 Difference]: Finished difference Result 228 states and 320 transitions. [2025-01-09 15:56:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:56:52,560 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 156 [2025-01-09 15:56:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:52,563 INFO L225 Difference]: With dead ends: 228 [2025-01-09 15:56:52,563 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 15:56:52,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:56:52,565 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 132 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:52,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 529 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2025-01-09 15:56:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 15:56:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-01-09 15:56:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:56:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 152 transitions. [2025-01-09 15:56:52,580 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 152 transitions. Word has length 156 [2025-01-09 15:56:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:52,580 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 152 transitions. [2025-01-09 15:56:52,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2025-01-09 15:56:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 152 transitions. [2025-01-09 15:56:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 15:56:52,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:52,581 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:52,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:56:52,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:52,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:52,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash 51328697, now seen corresponding path program 1 times [2025-01-09 15:56:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:52,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855872207] [2025-01-09 15:56:52,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:52,783 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:56:52,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:52,786 INFO L229 MonitoredProcess]: Starting monitored process 7 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:56:52,787 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 (7)] Waiting until timeout for monitored process [2025-01-09 15:56:52,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:56:53,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:56:53,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:53,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:53,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:56:53,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:53,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 15:56:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-01-09 15:56:53,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:53,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855872207] [2025-01-09 15:56:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855872207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:53,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:53,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:56:53,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822589130] [2025-01-09 15:56:53,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:53,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:53,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:53,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:53,599 INFO L87 Difference]: Start difference. First operand 109 states and 152 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:56:54,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:57,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:57:02,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:57:04,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:57:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:04,496 INFO L93 Difference]: Finished difference Result 216 states and 302 transitions. [2025-01-09 15:57:04,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:57:04,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2025-01-09 15:57:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:04,499 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:57:04,499 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:57:04,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:57:04,500 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 122 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:04,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 402 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 1 Unknown, 0 Unchecked, 10.8s Time] [2025-01-09 15:57:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:57:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 15:57:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:57:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2025-01-09 15:57:04,509 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 156 [2025-01-09 15:57:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:04,509 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2025-01-09 15:57:04,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:57:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2025-01-09 15:57:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:57:04,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:04,513 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:04,538 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 (7)] Ended with exit code 0 [2025-01-09 15:57:04,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:57:04,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:04,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2086239585, now seen corresponding path program 1 times [2025-01-09 15:57:04,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:57:04,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645927972] [2025-01-09 15:57:04,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:04,718 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:57:04,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:57:04,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:57:04,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:57:04,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:57:05,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:57:05,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:05,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:05,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:57:05,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:57:05,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:05,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 15:57:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-01-09 15:57:05,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:57:05,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:57:05,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645927972] [2025-01-09 15:57:05,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645927972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:05,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:57:05,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824230959] [2025-01-09 15:57:05,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:05,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:05,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:57:05,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:05,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:05,609 INFO L87 Difference]: Start difference. First operand 109 states and 151 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:57:09,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:57:14,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:57:15,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:57:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:16,142 INFO L93 Difference]: Finished difference Result 216 states and 300 transitions. [2025-01-09 15:57:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:57:16,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2025-01-09 15:57:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:16,144 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:57:16,144 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:57:16,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:57:16,145 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 106 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:16,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 397 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 1 Unknown, 0 Unchecked, 10.5s Time] [2025-01-09 15:57:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:57:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 15:57:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 88 states have internal predecessors, (112), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:57:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 150 transitions. [2025-01-09 15:57:16,153 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 150 transitions. Word has length 158 [2025-01-09 15:57:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:16,154 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 150 transitions. [2025-01-09 15:57:16,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:57:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2025-01-09 15:57:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:57:16,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:16,155 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:16,175 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 (8)] Ended with exit code 0 [2025-01-09 15:57:16,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:57:16,355 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:16,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1933359355, now seen corresponding path program 1 times [2025-01-09 15:57:16,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:57:16,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847047027] [2025-01-09 15:57:16,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:16,356 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:57:16,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:57:16,359 INFO L229 MonitoredProcess]: Starting monitored process 9 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:57:16,360 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 (9)] Waiting until timeout for monitored process [2025-01-09 15:57:16,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:57:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:57:17,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:17,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:17,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 15:57:17,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:57:17,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:57:17,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:57:17,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:57:17,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:57:17,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:57:17,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-01-09 15:57:21,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:21,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-01-09 15:57:22,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:22,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2025-01-09 15:57:22,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:22,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2025-01-09 15:57:22,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:22,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2025-01-09 15:57:22,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:22,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2025-01-09 15:57:23,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:23,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2025-01-09 15:57:23,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:23,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 46 [2025-01-09 15:57:23,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:23,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 46 [2025-01-09 15:57:23,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:23,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2025-01-09 15:57:23,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:23,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 23 [2025-01-09 15:57:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 51 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-01-09 15:57:23,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:57:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:57:23,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:57:23,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847047027] [2025-01-09 15:57:23,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847047027] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:57:23,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:57:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2025-01-09 15:57:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573740278] [2025-01-09 15:57:23,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:23,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:57:23,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:57:23,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:57:23,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2025-01-09 15:57:23,865 INFO L87 Difference]: Start difference. First operand 109 states and 150 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:57:28,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []