./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-50.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 fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:52:48,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:52:48,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:52:48,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:52:48,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:52:48,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:52:48,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:52:48,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:52:48,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:52:48,239 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:52:48,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:52:48,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:52:48,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:52:48,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:52:48,239 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:52:48,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:52:48,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:52:48,239 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:52:48,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:52:48,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:52:48,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:52:48,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:52:48,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:52:48,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:52:48,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:52:48,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:52:48,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:52:48,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:52:48,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:52:48,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:52:48,243 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 -> fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f [2025-02-06 03:52:48,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:52:48,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:52:48,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:52:48,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:52:48,489 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:52:48,490 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-50.i [2025-02-06 03:52:49,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4bc38090/8f84bcb83c674bcdb339e3dfbaeaf36a/FLAGe14d7ad74 [2025-02-06 03:52:49,934 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:52:49,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2025-02-06 03:52:49,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4bc38090/8f84bcb83c674bcdb339e3dfbaeaf36a/FLAGe14d7ad74 [2025-02-06 03:52:50,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4bc38090/8f84bcb83c674bcdb339e3dfbaeaf36a [2025-02-06 03:52:50,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:52:50,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:52:50,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:52:50,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:52:50,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:52:50,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eec23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50, skipping insertion in model container [2025-02-06 03:52:50,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:52:50,414 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-50.i[916,929] [2025-02-06 03:52:50,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:52:50,487 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:52:50,495 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-50.i[916,929] [2025-02-06 03:52:50,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:52:50,560 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:52:50,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50 WrapperNode [2025-02-06 03:52:50,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:52:50,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:52:50,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:52:50,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:52:50,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,616 INFO L138 Inliner]: procedures = 30, calls = 208, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 591 [2025-02-06 03:52:50,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:52:50,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:52:50,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:52:50,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:52:50,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,653 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:52:50,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:52:50,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:52:50,693 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:52:50,693 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:52:50,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (1/1) ... [2025-02-06 03:52:50,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:52:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:52:50,727 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-02-06 03:52:50,737 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-02-06 03:52:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:52:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:52:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:52:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:52:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:52:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:52:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:52:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:52:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:52:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:52:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:52:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:52:50,857 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:52:50,859 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:52:51,273 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite140#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem129#1;havoc property_#t~ite134#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~ite157#1;havoc property_#t~mem146#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem156#1;havoc property_#t~mem150#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~ite155#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short158#1;havoc property_#t~mem161#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite172#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~ite169#1;havoc property_#t~mem168#1;havoc property_#t~mem166#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~mem167#1;havoc property_#t~mem171#1;havoc property_#t~mem170#1;havoc property_#t~short173#1; [2025-02-06 03:52:51,323 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2025-02-06 03:52:51,323 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:52:51,333 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:52:51,334 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:52:51,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:51 BoogieIcfgContainer [2025-02-06 03:52:51,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:52:51,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:52:51,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:52:51,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:52:51,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:52:50" (1/3) ... [2025-02-06 03:52:51,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ded25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:52:51, skipping insertion in model container [2025-02-06 03:52:51,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:50" (2/3) ... [2025-02-06 03:52:51,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ded25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:52:51, skipping insertion in model container [2025-02-06 03:52:51,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:51" (3/3) ... [2025-02-06 03:52:51,343 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-50.i [2025-02-06 03:52:51,352 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:52:51,355 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-50.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:52:51,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:52:51,414 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;@738df4ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:52:51,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:52:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 03:52:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 03:52:51,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:51,433 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:51,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:51,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash -795494011, now seen corresponding path program 1 times [2025-02-06 03:52:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:52:51,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701745328] [2025-02-06 03:52:51,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:52:51,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 03:52:51,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 03:52:51,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:51,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 03:52:51,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:52:51,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701745328] [2025-02-06 03:52:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701745328] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:52:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402591665] [2025-02-06 03:52:51,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:51,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:52:51,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:52:51,821 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-02-06 03:52:51,825 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-02-06 03:52:51,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 03:52:52,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 03:52:52,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:52,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:52,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:52:52,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:52:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 03:52:52,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:52:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402591665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:52:52,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:52:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:52:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932974325] [2025-02-06 03:52:52,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:52,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:52:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:52:52,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:52:52,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:52:52,148 INFO L87 Difference]: Start difference. First operand has 129 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:52:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:52,167 INFO L93 Difference]: Finished difference Result 252 states and 401 transitions. [2025-02-06 03:52:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:52:52,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-02-06 03:52:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:52,173 INFO L225 Difference]: With dead ends: 252 [2025-02-06 03:52:52,173 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 03:52:52,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 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-02-06 03:52:52,177 INFO L435 NwaCegarLoop]: 185 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, 185 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-02-06 03:52:52,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:52:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 03:52:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-02-06 03:52:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 03:52:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2025-02-06 03:52:52,223 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 195 [2025-02-06 03:52:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:52,224 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2025-02-06 03:52:52,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:52:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2025-02-06 03:52:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 03:52:52,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:52,228 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:52,236 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-02-06 03:52:52,432 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-02-06 03:52:52,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:52,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1270123823, now seen corresponding path program 1 times [2025-02-06 03:52:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:52:52,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900449765] [2025-02-06 03:52:52,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:52:52,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 03:52:52,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 03:52:52,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:52,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 03:52:53,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:52:53,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900449765] [2025-02-06 03:52:53,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900449765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:52:53,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:52:53,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:52:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219360399] [2025-02-06 03:52:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:53,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:52:53,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:52:53,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:52:53,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:52:53,199 INFO L87 Difference]: Start difference. First operand 126 states and 185 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 03:52:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:53,752 INFO L93 Difference]: Finished difference Result 403 states and 594 transitions. [2025-02-06 03:52:53,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:52:53,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 195 [2025-02-06 03:52:53,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:53,755 INFO L225 Difference]: With dead ends: 403 [2025-02-06 03:52:53,755 INFO L226 Difference]: Without dead ends: 280 [2025-02-06 03:52:53,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:52:53,756 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 184 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:52:53,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 581 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:52:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-06 03:52:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2025-02-06 03:52:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 207 states have internal predecessors, (284), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:52:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 388 transitions. [2025-02-06 03:52:53,784 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 388 transitions. Word has length 195 [2025-02-06 03:52:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:53,784 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 388 transitions. [2025-02-06 03:52:53,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 03:52:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 388 transitions. [2025-02-06 03:52:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 03:52:53,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:53,787 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:53,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:52:53,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:53,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1397310387, now seen corresponding path program 1 times [2025-02-06 03:52:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:52:53,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150220726] [2025-02-06 03:52:53,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:53,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:52:53,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 03:52:53,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 03:52:53,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:53,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 03:52:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:52:55,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150220726] [2025-02-06 03:52:55,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150220726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:52:55,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:52:55,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:52:55,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19752607] [2025-02-06 03:52:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:55,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:52:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:52:55,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:52:55,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:52:55,465 INFO L87 Difference]: Start difference. First operand 262 states and 388 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:52:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:56,008 INFO L93 Difference]: Finished difference Result 677 states and 999 transitions. [2025-02-06 03:52:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:52:56,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-02-06 03:52:56,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:56,012 INFO L225 Difference]: With dead ends: 677 [2025-02-06 03:52:56,014 INFO L226 Difference]: Without dead ends: 418 [2025-02-06 03:52:56,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:52:56,015 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 95 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:52:56,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 857 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:52:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-06 03:52:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2025-02-06 03:52:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 341 states have (on average 1.3841642228739004) internal successors, (472), 343 states have internal predecessors, (472), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:52:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 608 transitions. [2025-02-06 03:52:56,055 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 608 transitions. Word has length 195 [2025-02-06 03:52:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:56,058 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 608 transitions. [2025-02-06 03:52:56,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:52:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 608 transitions. [2025-02-06 03:52:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-06 03:52:56,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:56,060 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:56,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:52:56,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:56,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1930628969, now seen corresponding path program 1 times [2025-02-06 03:52:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:52:56,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920545331] [2025-02-06 03:52:56,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:56,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:52:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 03:52:56,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 03:52:56,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:56,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:52:56,243 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:52:56,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 03:52:56,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 03:52:56,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:56,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:52:56,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:52:56,420 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:52:56,421 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:52:56,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:52:56,424 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 03:52:56,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:52:56,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:52:56 BoogieIcfgContainer [2025-02-06 03:52:56,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:52:56,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:52:56,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:52:56,507 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:52:56,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:51" (3/4) ... [2025-02-06 03:52:56,510 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:52:56,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:52:56,511 INFO L158 Benchmark]: Toolchain (without parser) took 6247.89ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 109.1MB in the beginning and 393.3MB in the end (delta: -284.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2025-02-06 03:52:56,515 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:52:56,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.97ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 90.0MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:52:56,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.10ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 86.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:52:56,515 INFO L158 Benchmark]: Boogie Preprocessor took 71.99ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 82.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:52:56,515 INFO L158 Benchmark]: IcfgBuilder took 642.32ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 48.0MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:52:56,515 INFO L158 Benchmark]: TraceAbstraction took 5165.89ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 46.5MB in the beginning and 393.5MB in the end (delta: -346.9MB). Peak memory consumption was 195.1MB. Max. memory is 16.1GB. [2025-02-06 03:52:56,515 INFO L158 Benchmark]: Witness Printer took 6.99ms. Allocated memory is still 444.6MB. Free memory was 393.5MB in the beginning and 393.3MB in the end (delta: 138.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:52:56,517 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.49ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.97ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 90.0MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.10ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 86.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.99ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 82.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 642.32ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 48.0MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5165.89ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 46.5MB in the beginning and 393.5MB in the end (delta: -346.9MB). Peak memory consumption was 195.1MB. Max. memory is 16.1GB. * Witness Printer took 6.99ms. Allocated memory is still 444.6MB. Free memory was 393.5MB in the beginning and 393.3MB in the end (delta: 138.5kB). 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 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L63] signed long int last_1_WrapperStruct00_var_1_18 = -5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_18=-5] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] CALL updateLastVariables() [L141] EXPR WrapperStruct00.var_1_18 [L141] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L151] RET updateLastVariables() [L152] CALL updateVariables() [L98] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_2 [L99] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_2 [L99] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L100] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_4 [L103] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_4 [L103] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L104] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_5 [L105] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_5 [L105] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L106] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L109] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L112] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L115] WrapperStruct00.var_1_13 = __VERIFIER_nondet_short() [L116] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L121] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L127] WrapperStruct00.var_1_17 = __VERIFIER_nondet_short() [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L130] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L131] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L133] WrapperStruct00.var_1_20 = __VERIFIER_nondet_long() [L134] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L136] WrapperStruct00.var_1_21 = __VERIFIER_nondet_long() [L137] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L137] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L137] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L152] RET updateVariables() [L153] CALL step() [L67] signed long int stepLocal_1 = last_1_WrapperStruct00_var_1_18; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_1=-5] [L68] COND FALSE !(stepLocal_1 >= 0) [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_15 [L71] EXPR WrapperStruct00.var_1_16 [L71] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L71] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))) [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L71] WrapperStruct00.var_1_12 = ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))) [L73] EXPR WrapperStruct00.var_1_15 [L73] EXPR WrapperStruct00.var_1_19 [L73] signed long int stepLocal_3 = WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19; [L74] EXPR WrapperStruct00.var_1_12 [L74] signed short int stepLocal_2 = WrapperStruct00.var_1_12; [L75] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=7, stepLocal_3=32757] [L75] COND FALSE !(WrapperStruct00.var_1_12 > stepLocal_3) [L80] EXPR WrapperStruct00.var_1_14 [L80] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_14 [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=7] [L82] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18) [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=7] [L82] signed long int stepLocal_0 = (((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18)); [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR WrapperStruct00.var_1_4 [L83] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=7, stepLocal_2=7] [L83] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=7, stepLocal_2=7] [L83] COND TRUE (((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9 [L84] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=7, stepLocal_2=7] [L84] COND FALSE !(stepLocal_0 < WrapperStruct00.var_1_18) [L91] EXPR WrapperStruct00.var_1_10 [L91] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_10 [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR WrapperStruct00.var_1_2 [L144] EXPR WrapperStruct00.var_1_3 [L144] EXPR WrapperStruct00.var_1_4 [L144] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L144] EXPR WrapperStruct00.var_1_2 [L144] EXPR WrapperStruct00.var_1_3 [L144] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR ((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11)) [L144] EXPR WrapperStruct00.var_1_1 [L144] EXPR WrapperStruct00.var_1_11 [L144] EXPR ((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR (((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR ((((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))))))) && ((WrapperStruct00.var_1_12 > (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19)) ? ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_18 == ((signed long int) ((WrapperStruct00.var_1_17 + (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_20)) - WrapperStruct00.var_1_21))) : 1) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144-L145] return ((((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))))))) && ((WrapperStruct00.var_1_12 > (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19)) ? ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_18 == ((signed long int) ((WrapperStruct00.var_1_17 + (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_20)) - WrapperStruct00.var_1_21))) : 1) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_14))) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 1623 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1069 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 626 IncrementalHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 554 mSDtfsCounter, 626 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 976 NumberOfCodeBlocks, 976 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 1121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 5150/5200 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-02-06 03:52:56,548 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-50.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 fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:52:58,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:52:58,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:52:58,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:52:58,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:52:58,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:52:58,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:52:58,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:52:58,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:52:58,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:52:58,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:52:58,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:52:58,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:52:58,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:52:58,694 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:52:58,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:52:58,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:52:58,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:52:58,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:52:58,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:52:58,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:52:58,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:52:58,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:52:58,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:52:58,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:52:58,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:52:58,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:52:58,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:52:58,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:52:58,696 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:52:58,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:52:58,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:52:58,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:52:58,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:52:58,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:52:58,697 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 -> fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f [2025-02-06 03:52:58,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:52:58,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:52:58,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:52:58,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:52:58,949 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:52:58,950 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-50.i [2025-02-06 03:53:00,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3474c2ad/59a2cdd70a754bfc9c89f9019bf48684/FLAG83dfcee23 [2025-02-06 03:53:00,347 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:53:00,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2025-02-06 03:53:00,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3474c2ad/59a2cdd70a754bfc9c89f9019bf48684/FLAG83dfcee23 [2025-02-06 03:53:00,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3474c2ad/59a2cdd70a754bfc9c89f9019bf48684 [2025-02-06 03:53:00,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:53:00,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:53:00,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:53:00,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:53:00,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:53:00,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:53:00" (1/1) ... [2025-02-06 03:53:00,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eeefbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:00, skipping insertion in model container [2025-02-06 03:53:00,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:53:00" (1/1) ... [2025-02-06 03:53:00,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:53:00,841 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-50.i[916,929] [2025-02-06 03:53:00,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:53:00,921 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:53:00,930 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-50.i[916,929] [2025-02-06 03:53:00,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:53:01,015 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:53:01,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01 WrapperNode [2025-02-06 03:53:01,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:53:01,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:53:01,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:53:01,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:53:01,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,085 INFO L138 Inliner]: procedures = 37, calls = 208, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 582 [2025-02-06 03:53:01,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:53:01,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:53:01,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:53:01,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:53:01,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,116 INFO L175 MemorySlicer]: Split 171 memory accesses to 2 slices as follows [2, 169]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-02-06 03:53:01,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:53:01,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:53:01,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:53:01,144 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:53:01,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (1/1) ... [2025-02-06 03:53:01,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:53:01,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:53:01,176 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-02-06 03:53:01,184 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-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:53:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:53:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:53:01,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:53:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:53:01,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:53:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:53:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:53:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:53:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:53:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:53:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:53:01,321 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:53:01,322 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:53:06,528 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite140#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem129#1;havoc property_#t~ite134#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~ite157#1;havoc property_#t~mem146#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem156#1;havoc property_#t~mem150#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~ite155#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short158#1;havoc property_#t~mem161#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite172#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~ite169#1;havoc property_#t~mem168#1;havoc property_#t~mem166#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~mem167#1;havoc property_#t~mem171#1;havoc property_#t~mem170#1;havoc property_#t~short173#1; [2025-02-06 03:53:06,551 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2025-02-06 03:53:06,552 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:53:06,559 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:53:06,559 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:53:06,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:53:06 BoogieIcfgContainer [2025-02-06 03:53:06,560 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:53:06,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:53:06,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:53:06,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:53:06,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:53:00" (1/3) ... [2025-02-06 03:53:06,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd51da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:53:06, skipping insertion in model container [2025-02-06 03:53:06,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:01" (2/3) ... [2025-02-06 03:53:06,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd51da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:53:06, skipping insertion in model container [2025-02-06 03:53:06,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:53:06" (3/3) ... [2025-02-06 03:53:06,566 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-50.i [2025-02-06 03:53:06,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:53:06,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-50.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:53:06,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:53:06,616 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;@314f8bb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:53:06,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:53:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 03:53:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 03:53:06,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:06,628 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:06,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:06,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2026790071, now seen corresponding path program 1 times [2025-02-06 03:53:06,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:06,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734327119] [2025-02-06 03:53:06,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:06,641 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-02-06 03:53:06,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:06,643 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-02-06 03:53:06,645 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-02-06 03:53:06,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 03:53:07,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 03:53:07,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:07,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:07,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:53:07,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2025-02-06 03:53:07,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:07,265 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:07,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734327119] [2025-02-06 03:53:07,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734327119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:07,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:07,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:53:07,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119656098] [2025-02-06 03:53:07,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:07,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:53:07,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:07,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:53:07,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:53:07,291 INFO L87 Difference]: Start difference. First operand has 129 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:53:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:07,326 INFO L93 Difference]: Finished difference Result 252 states and 401 transitions. [2025-02-06 03:53:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:53:07,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-02-06 03:53:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:07,334 INFO L225 Difference]: With dead ends: 252 [2025-02-06 03:53:07,334 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 03:53:07,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 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-02-06 03:53:07,344 INFO L435 NwaCegarLoop]: 185 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, 185 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-02-06 03:53:07,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:53:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 03:53:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-02-06 03:53:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 03:53:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2025-02-06 03:53:07,399 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 195 [2025-02-06 03:53:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:07,399 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2025-02-06 03:53:07,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:53:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2025-02-06 03:53:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 03:53:07,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:07,407 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:07,448 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-02-06 03:53:07,607 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-02-06 03:53:07,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:07,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 38827763, now seen corresponding path program 1 times [2025-02-06 03:53:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813907475] [2025-02-06 03:53:07,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:07,615 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-02-06 03:53:07,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:07,617 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-02-06 03:53:07,618 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-02-06 03:53:07,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 03:53:08,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 03:53:08,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:08,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:08,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:53:08,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:08,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:08,504 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-02-06 03:53:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2025-02-06 03:53:08,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:08,548 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:08,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813907475] [2025-02-06 03:53:08,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813907475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:08,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:53:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485693351] [2025-02-06 03:53:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:08,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:53:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:08,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:53:08,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:53:08,551 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:53:11,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:13,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:15,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:18,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:18,235 INFO L93 Difference]: Finished difference Result 250 states and 368 transitions. [2025-02-06 03:53:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:53:18,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-02-06 03:53:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:18,237 INFO L225 Difference]: With dead ends: 250 [2025-02-06 03:53:18,237 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 03:53:18,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 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-02-06 03:53:18,238 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 164 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:18,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 514 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2025-02-06 03:53:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 03:53:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-02-06 03:53:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 03:53:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2025-02-06 03:53:18,245 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 195 [2025-02-06 03:53:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:18,246 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2025-02-06 03:53:18,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:53:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2025-02-06 03:53:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-06 03:53:18,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:18,248 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:18,267 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-02-06 03:53:18,452 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-02-06 03:53:18,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:18,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1043080811, now seen corresponding path program 1 times [2025-02-06 03:53:18,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:18,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707143519] [2025-02-06 03:53:18,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:18,453 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-02-06 03:53:18,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:18,456 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-02-06 03:53:18,457 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-02-06 03:53:18,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 03:53:18,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 03:53:18,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:18,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:19,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:53:19,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:19,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:19,136 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-02-06 03:53:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2025-02-06 03:53:19,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:19,167 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707143519] [2025-02-06 03:53:19,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707143519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:19,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:19,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:53:19,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841662887] [2025-02-06 03:53:19,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:19,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:53:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:19,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:53:19,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:53:19,169 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:53:21,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:23,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:26,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:27,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:28,282 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2025-02-06 03:53:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:53:28,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 197 [2025-02-06 03:53:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:28,284 INFO L225 Difference]: With dead ends: 250 [2025-02-06 03:53:28,284 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 03:53:28,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 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-02-06 03:53:28,285 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 155 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:28,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 508 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-02-06 03:53:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 03:53:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-02-06 03:53:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 03:53:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2025-02-06 03:53:28,291 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 197 [2025-02-06 03:53:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:28,292 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2025-02-06 03:53:28,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 03:53:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2025-02-06 03:53:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-06 03:53:28,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:28,295 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:28,315 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-02-06 03:53:28,500 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-02-06 03:53:28,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:28,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:28,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1632252275, now seen corresponding path program 1 times [2025-02-06 03:53:28,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:28,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713775749] [2025-02-06 03:53:28,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:28,501 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-02-06 03:53:28,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:28,503 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-02-06 03:53:28,505 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-02-06 03:53:28,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-06 03:53:29,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-06 03:53:29,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:29,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:29,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:53:29,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:29,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,617 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 03:53:29,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:29,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 71 [2025-02-06 03:53:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 03:53:30,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:30,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:30,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713775749] [2025-02-06 03:53:30,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713775749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:30,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:30,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:53:30,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333619014] [2025-02-06 03:53:30,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:30,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:53:30,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:30,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:53:30,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:53:30,430 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 03:53:32,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:34,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:36,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:36,712 INFO L93 Difference]: Finished difference Result 373 states and 541 transitions. [2025-02-06 03:53:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:53:36,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 199 [2025-02-06 03:53:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:36,715 INFO L225 Difference]: With dead ends: 373 [2025-02-06 03:53:36,715 INFO L226 Difference]: Without dead ends: 250 [2025-02-06 03:53:36,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:53:36,716 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 109 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:36,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 592 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-02-06 03:53:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-06 03:53:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2025-02-06 03:53:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 178 states have internal predecessors, (235), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:53:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2025-02-06 03:53:36,733 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 199 [2025-02-06 03:53:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:36,734 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2025-02-06 03:53:36,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 03:53:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2025-02-06 03:53:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-06 03:53:36,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:36,735 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:36,756 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-02-06 03:53:36,940 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-02-06 03:53:36,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:36,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1759438839, now seen corresponding path program 1 times [2025-02-06 03:53:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36847549] [2025-02-06 03:53:36,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:36,941 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-02-06 03:53:36,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:36,944 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-02-06 03:53:36,945 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-02-06 03:53:37,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-06 03:53:37,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-06 03:53:37,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:37,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:38,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:53:38,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:38,046 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-02-06 03:53:38,112 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-02-06 03:53:38,165 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 26 treesize of output 25 [2025-02-06 03:53:38,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:38,343 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-02-06 03:53:38,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:38,560 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-02-06 03:53:38,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:38,724 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-02-06 03:53:38,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:38,888 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-02-06 03:53:39,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:39,058 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-02-06 03:53:39,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:39,194 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-02-06 03:53:39,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:39,408 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 47 treesize of output 52 [2025-02-06 03:53:39,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:39,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 55 [2025-02-06 03:53:39,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:39,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2025-02-06 03:53:39,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:39,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 48 [2025-02-06 03:53:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 827 proven. 48 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-02-06 03:53:39,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:53:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 03:53:40,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:40,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36847549] [2025-02-06 03:53:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36847549] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:40,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:53:40,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2025-02-06 03:53:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144115147] [2025-02-06 03:53:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:40,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:53:40,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:40,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:53:40,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:53:40,035 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 03:53:42,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:43,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:45,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:46,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:48,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:50,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:53:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:50,831 INFO L93 Difference]: Finished difference Result 444 states and 643 transitions. [2025-02-06 03:53:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:53:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 199 [2025-02-06 03:53:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:50,834 INFO L225 Difference]: With dead ends: 444 [2025-02-06 03:53:50,834 INFO L226 Difference]: Without dead ends: 321 [2025-02-06 03:53:50,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:53:50,835 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 93 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:50,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 719 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2025-02-06 03:53:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-06 03:53:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2025-02-06 03:53:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 253 states have (on average 1.3399209486166008) internal successors, (339), 254 states have internal predecessors, (339), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:53:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 459 transitions. [2025-02-06 03:53:50,859 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 459 transitions. Word has length 199 [2025-02-06 03:53:50,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:50,860 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 459 transitions. [2025-02-06 03:53:50,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 03:53:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 459 transitions. [2025-02-06 03:53:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-06 03:53:50,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:50,864 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:50,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:53:51,068 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-02-06 03:53:51,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:51,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash 271709097, now seen corresponding path program 1 times [2025-02-06 03:53:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791907202] [2025-02-06 03:53:51,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:51,069 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-02-06 03:53:51,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:51,073 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-02-06 03:53:51,074 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-02-06 03:53:51,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-06 03:53:52,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-06 03:53:52,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:52,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:52,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 03:53:52,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:52,161 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-02-06 03:53:52,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 59 [2025-02-06 03:53:53,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:53,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 245 treesize of output 137 [2025-02-06 03:53:58,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:58,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 265 treesize of output 163 [2025-02-06 03:54:07,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:07,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 284 treesize of output 169 [2025-02-06 03:54:08,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:08,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 279 treesize of output 179 [2025-02-06 03:54:09,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:09,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 289 treesize of output 192 [2025-02-06 03:54:11,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:11,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 299 treesize of output 205 [2025-02-06 03:54:12,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:12,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 314 treesize of output 208 [2025-02-06 03:54:13,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:13,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 314 treesize of output 208 [2025-02-06 03:54:15,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:15,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 314 treesize of output 208 [2025-02-06 03:54:16,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:16,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 314 treesize of output 208 [2025-02-06 03:54:17,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:17,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 314 treesize of output 208 [2025-02-06 03:54:18,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:18,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 314 treesize of output 208 [2025-02-06 03:54:19,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:19,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 314 treesize of output 208 [2025-02-06 03:54:21,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:21,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 310 treesize of output 219 [2025-02-06 03:54:22,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:22,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 325 treesize of output 222 [2025-02-06 03:54:22,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:22,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 325 treesize of output 231 [2025-02-06 03:54:23,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:23,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 423 treesize of output 149 [2025-02-06 03:54:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 800 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-02-06 03:54:27,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:27,599 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:54:27,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791907202] [2025-02-06 03:54:27,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791907202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:27,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:27,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:54:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131629308] [2025-02-06 03:54:27,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:27,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:54:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:54:27,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:54:27,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=249, Unknown=3, NotChecked=0, Total=342 [2025-02-06 03:54:27,603 INFO L87 Difference]: Start difference. First operand 318 states and 459 transitions. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 7 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26)