./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:06:27,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:06:27,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:06:27,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:06:27,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:06:27,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:06:27,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:06:27,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:06:27,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:06:27,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:06:27,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:06:27,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:06:27,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:06:27,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:06:27,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:06:27,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:06:27,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:06:27,134 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:06:27,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:06:27,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:06:27,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:06:27,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:06:27,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:06:27,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:06:27,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:06:27,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:06:27,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:06:27,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:06:27,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:06:27,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:06:27,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:06:27,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:06:27,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:06:27,136 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/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 -> 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b [2025-03-17 06:06:27,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:06:27,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:06:27,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:06:27,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:06:27,367 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:06:27,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2025-03-17 06:06:28,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf7158a9/d787a4ce35b24f1e9d8ab460ffa1f204/FLAG88cb86d41 [2025-03-17 06:06:28,701 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:06:28,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2025-03-17 06:06:28,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf7158a9/d787a4ce35b24f1e9d8ab460ffa1f204/FLAG88cb86d41 [2025-03-17 06:06:29,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf7158a9/d787a4ce35b24f1e9d8ab460ffa1f204 [2025-03-17 06:06:29,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:06:29,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:06:29,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:06:29,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:06:29,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:06:29,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f78254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29, skipping insertion in model container [2025-03-17 06:06:29,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:06:29,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i[917,930] [2025-03-17 06:06:29,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:06:29,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:06:29,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i[917,930] [2025-03-17 06:06:29,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:06:29,248 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:06:29,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29 WrapperNode [2025-03-17 06:06:29,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:06:29,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:06:29,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:06:29,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:06:29,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,307 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-03-17 06:06:29,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:06:29,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:06:29,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:06:29,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:06:29,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,337 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:06:29,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:06:29,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:06:29,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:06:29,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:06:29,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (1/1) ... [2025-03-17 06:06:29,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:06:29,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:29,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:06:29,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:06:29,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:06:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:06:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:06:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:06:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:06:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:06:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:06:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:06:29,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:06:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:06:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:06:29,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:06:29,513 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:06:29,514 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:06:29,937 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-17 06:06:29,981 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-17 06:06:29,981 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:06:29,990 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:06:29,990 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:06:29,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:06:29 BoogieIcfgContainer [2025-03-17 06:06:29,990 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:06:29,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:06:29,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:06:29,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:06:29,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:06:29" (1/3) ... [2025-03-17 06:06:29,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d169b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:06:29, skipping insertion in model container [2025-03-17 06:06:29,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:29" (2/3) ... [2025-03-17 06:06:29,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d169b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:06:29, skipping insertion in model container [2025-03-17 06:06:29,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:06:29" (3/3) ... [2025-03-17 06:06:29,999 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-26.i [2025-03-17 06:06:30,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:06:30,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-26.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:06:30,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:06:30,054 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;@79b69b60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:06:30,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:06:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:30,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:30,065 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:30,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 839383201, now seen corresponding path program 1 times [2025-03-17 06:06:30,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:30,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588768263] [2025-03-17 06:06:30,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:30,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:30,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:30,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:30,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 06:06:30,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588768263] [2025-03-17 06:06:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588768263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:06:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945996828] [2025-03-17 06:06:30,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:30,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:06:30,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:30,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:06:30,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:06:30,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:30,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:30,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:30,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:30,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:06:30,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 06:06:30,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945996828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:30,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:06:30,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:06:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726329996] [2025-03-17 06:06:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:30,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:06:30,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:30,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:06:30,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:06:30,589 INFO L87 Difference]: Start difference. First operand has 87 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:30,608 INFO L93 Difference]: Finished difference Result 171 states and 261 transitions. [2025-03-17 06:06:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:06:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-17 06:06:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:30,613 INFO L225 Difference]: With dead ends: 171 [2025-03-17 06:06:30,613 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:06:30,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-03-17 06:06:30,617 INFO L435 NwaCegarLoop]: 123 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, 123 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-03-17 06:06:30,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:30,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:06:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 06:06:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2025-03-17 06:06:30,642 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 85 [2025-03-17 06:06:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:30,643 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2025-03-17 06:06:30,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2025-03-17 06:06:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:30,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:30,646 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:30,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:06:30,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:06:30,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:30,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:30,855 INFO L85 PathProgramCache]: Analyzing trace with hash 877178568, now seen corresponding path program 1 times [2025-03-17 06:06:30,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:30,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503446511] [2025-03-17 06:06:30,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:30,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:30,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:30,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:30,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:31,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503446511] [2025-03-17 06:06:31,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503446511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:31,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:31,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:06:31,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521442555] [2025-03-17 06:06:31,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:31,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:06:31,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:31,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:06:31,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:06:31,141 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:31,170 INFO L93 Difference]: Finished difference Result 172 states and 249 transitions. [2025-03-17 06:06:31,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:06:31,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2025-03-17 06:06:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:31,172 INFO L225 Difference]: With dead ends: 172 [2025-03-17 06:06:31,172 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 06:06:31,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:06:31,173 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:31,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 351 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 06:06:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-17 06:06:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-03-17 06:06:31,179 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 85 [2025-03-17 06:06:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:31,179 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-03-17 06:06:31,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-03-17 06:06:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:31,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:31,181 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:31,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:06:31,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:31,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash 878102089, now seen corresponding path program 1 times [2025-03-17 06:06:31,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:31,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823576125] [2025-03-17 06:06:31,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:31,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:31,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:31,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:31,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:31,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:31,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:31,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823576125] [2025-03-17 06:06:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823576125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:31,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:31,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799311015] [2025-03-17 06:06:31,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:31,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:31,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:31,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:31,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:31,508 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:31,524 INFO L93 Difference]: Finished difference Result 173 states and 249 transitions. [2025-03-17 06:06:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:31,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2025-03-17 06:06:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:31,525 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:06:31,526 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:06:31,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:31,526 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:31,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:06:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:06:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-03-17 06:06:31,534 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 85 [2025-03-17 06:06:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:31,536 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-03-17 06:06:31,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-03-17 06:06:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:31,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:31,537 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:31,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:06:31,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:31,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:31,538 INFO L85 PathProgramCache]: Analyzing trace with hash 469277864, now seen corresponding path program 1 times [2025-03-17 06:06:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:31,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318943305] [2025-03-17 06:06:31,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:31,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:31,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:31,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:31,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:31,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:31,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:31,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318943305] [2025-03-17 06:06:31,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318943305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:31,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:31,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722312913] [2025-03-17 06:06:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:31,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:31,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:31,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:31,844 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:31,935 INFO L93 Difference]: Finished difference Result 173 states and 247 transitions. [2025-03-17 06:06:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:31,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2025-03-17 06:06:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:31,937 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:06:31,937 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:06:31,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:31,938 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:31,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:06:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:06:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:06:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2025-03-17 06:06:31,943 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 85 [2025-03-17 06:06:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:31,943 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2025-03-17 06:06:31,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2025-03-17 06:06:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:31,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:31,944 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:31,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:06:31,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:31,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash -36280761, now seen corresponding path program 1 times [2025-03-17 06:06:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:31,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89517484] [2025-03-17 06:06:31,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:31,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:32,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:32,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:32,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:06:32,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232836685] [2025-03-17 06:06:32,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:32,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:06:32,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:32,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:06:32,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:06:32,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:33,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:33,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:33,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:06:33,328 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:06:33,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:33,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:33,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:33,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:06:33,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:06:33,640 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:06:33,641 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:06:33,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:06:33,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:06:33,852 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 06:06:33,932 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:06:33,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:06:33 BoogieIcfgContainer [2025-03-17 06:06:33,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:06:33,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:06:33,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:06:33,936 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:06:33,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:06:29" (3/4) ... [2025-03-17 06:06:33,938 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:06:33,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:06:33,939 INFO L158 Benchmark]: Toolchain (without parser) took 4908.40ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 105.4MB in the beginning and 188.9MB in the end (delta: -83.5MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2025-03-17 06:06:33,939 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:06:33,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.57ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 90.2MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:06:33,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.93ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 86.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:06:33,940 INFO L158 Benchmark]: Boogie Preprocessor took 45.44ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 83.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:06:33,940 INFO L158 Benchmark]: IcfgBuilder took 632.39ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 48.3MB in the end (delta: 35.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 06:06:33,940 INFO L158 Benchmark]: TraceAbstraction took 3942.93ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 48.3MB in the beginning and 189.0MB in the end (delta: -140.7MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2025-03-17 06:06:33,940 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 293.6MB. Free memory was 189.0MB in the beginning and 188.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:06:33,941 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.47ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.57ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 90.2MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.93ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 86.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.44ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 83.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 632.39ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 48.3MB in the end (delta: 35.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3942.93ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 48.3MB in the beginning and 189.0MB in the end (delta: -140.7MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 293.6MB. Free memory was 189.0MB in the beginning and 188.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L47] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] signed short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L49] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L50] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L51] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L52] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L53] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L54] unsigned long int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L55] signed long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L56] float* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L57] unsigned char last_1_WrapperStruct00_var_1_15 = 64; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] EXPR WrapperStruct00.var_1_15 [L93] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L103] RET updateLastVariables() [L104] CALL updateVariables() [L77] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L78] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L81] EXPR WrapperStruct00.var_1_13 [L81] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L81] EXPR WrapperStruct00.var_1_13 [L81] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L82] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L83] EXPR WrapperStruct00.var_1_14 [L83] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L83] EXPR WrapperStruct00.var_1_14 [L83] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L84] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L87] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L88] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L89] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L90] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L104] RET updateVariables() [L105] CALL step() [L61] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L61] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L61] (*(WrapperStruct00_var_1_12_Pointer)) = ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))) [L62] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L62] COND TRUE (- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4)))) [L63] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L63] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L65] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L65] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L66] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L66] EXPR \read(*WrapperStruct00_var_1_20_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L66] COND TRUE (*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer)) [L67] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L67] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L67] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L67] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L67] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L67] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) [L71] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))); [L72] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L72] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L72] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64, stepLocal_0=192] [L72] COND FALSE !(stepLocal_0 != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_20_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))))))) [L96] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))))) [L96] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L96] EXPR (((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96-L97] return ((((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 136 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 897 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 413 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 484 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 704/720 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-03-17 06:06:33,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:06:35,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:06:35,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:06:35,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:06:35,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:06:35,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:06:35,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:06:35,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:06:35,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:06:35,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:06:35,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:06:35,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:06:35,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:06:35,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:06:35,859 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:06:35,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:06:35,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:06:35,859 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:06:35,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:06:35,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:06:35,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:06:35,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:06:35,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:06:35,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:06:35,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:06:35,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:06:35,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:06:35,861 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:06:35,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:06:35,861 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:06:35,861 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:06:35,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:06:35,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:06:35,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:06:35,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:06:35,861 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/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 -> 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b [2025-03-17 06:06:36,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:06:36,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:06:36,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:06:36,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:06:36,114 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:06:36,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2025-03-17 06:06:37,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed41056bc/cfb1e5050d4243dd876218fb868b2aaa/FLAGe86f5a3ce [2025-03-17 06:06:37,465 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:06:37,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2025-03-17 06:06:37,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed41056bc/cfb1e5050d4243dd876218fb868b2aaa/FLAGe86f5a3ce [2025-03-17 06:06:37,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed41056bc/cfb1e5050d4243dd876218fb868b2aaa [2025-03-17 06:06:37,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:06:37,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:06:37,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:06:37,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:06:37,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:06:37,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5812e66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37, skipping insertion in model container [2025-03-17 06:06:37,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:06:37,593 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i[917,930] [2025-03-17 06:06:37,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:06:37,662 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:06:37,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i[917,930] [2025-03-17 06:06:37,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:06:37,712 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:06:37,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37 WrapperNode [2025-03-17 06:06:37,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:06:37,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:06:37,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:06:37,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:06:37,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,752 INFO L138 Inliner]: procedures = 37, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2025-03-17 06:06:37,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:06:37,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:06:37,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:06:37,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:06:37,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,786 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 22 writes are split as follows [0, 22]. [2025-03-17 06:06:37,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:06:37,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:06:37,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:06:37,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:06:37,816 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (1/1) ... [2025-03-17 06:06:37,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:06:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:37,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:06:37,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:06:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:06:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:06:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:06:37,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:06:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:06:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:06:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:06:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:06:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:06:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:06:37,990 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:06:37,992 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:06:39,052 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-17 06:06:39,102 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-17 06:06:39,102 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:06:39,109 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:06:39,109 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:06:39,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:06:39 BoogieIcfgContainer [2025-03-17 06:06:39,110 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:06:39,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:06:39,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:06:39,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:06:39,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:06:37" (1/3) ... [2025-03-17 06:06:39,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de24af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:06:39, skipping insertion in model container [2025-03-17 06:06:39,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:37" (2/3) ... [2025-03-17 06:06:39,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de24af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:06:39, skipping insertion in model container [2025-03-17 06:06:39,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:06:39" (3/3) ... [2025-03-17 06:06:39,117 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-26.i [2025-03-17 06:06:39,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:06:39,128 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-26.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:06:39,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:06:39,175 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;@5b24c744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:06:39,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:06:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:39,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:39,186 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:39,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:39,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1844373494, now seen corresponding path program 1 times [2025-03-17 06:06:39,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:39,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883434427] [2025-03-17 06:06:39,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:39,198 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-03-17 06:06:39,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:39,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-17 06:06:39,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:39,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:39,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:39,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:39,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:39,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:06:39,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 06:06:39,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:39,531 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:39,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883434427] [2025-03-17 06:06:39,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883434427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:39,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:39,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:06:39,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816398965] [2025-03-17 06:06:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:39,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:06:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:39,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:06:39,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:06:39,554 INFO L87 Difference]: Start difference. First operand has 87 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:39,577 INFO L93 Difference]: Finished difference Result 171 states and 261 transitions. [2025-03-17 06:06:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:06:39,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-17 06:06:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:39,582 INFO L225 Difference]: With dead ends: 171 [2025-03-17 06:06:39,583 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:06:39,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 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-03-17 06:06:39,586 INFO L435 NwaCegarLoop]: 123 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, 123 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-03-17 06:06:39,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:06:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 06:06:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2025-03-17 06:06:39,615 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 85 [2025-03-17 06:06:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:39,616 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2025-03-17 06:06:39,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2025-03-17 06:06:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:39,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:39,619 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:39,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:39,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-17 06:06:39,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:39,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1882168861, now seen corresponding path program 1 times [2025-03-17 06:06:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:39,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342072515] [2025-03-17 06:06:39,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:39,821 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-03-17 06:06:39,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:39,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-17 06:06:39,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:39,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:40,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:40,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:40,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:40,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:40,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 06:06:40,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:40,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342072515] [2025-03-17 06:06:40,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342072515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:40,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:06:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912194015] [2025-03-17 06:06:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:40,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:06:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:40,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:06:40,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:06:40,173 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:40,444 INFO L93 Difference]: Finished difference Result 171 states and 248 transitions. [2025-03-17 06:06:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:06:40,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-17 06:06:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:40,451 INFO L225 Difference]: With dead ends: 171 [2025-03-17 06:06:40,451 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:06:40,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:06:40,452 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:40,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:06:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:06:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:06:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-03-17 06:06:40,460 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 85 [2025-03-17 06:06:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:40,461 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-03-17 06:06:40,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-03-17 06:06:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:40,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:40,463 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:40,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2025-03-17 06:06:40,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-17 06:06:40,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1929123108, now seen corresponding path program 1 times [2025-03-17 06:06:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606777634] [2025-03-17 06:06:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:40,665 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-03-17 06:06:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:40,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-17 06:06:40,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:40,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:40,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:40,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:40,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:40,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:40,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:40,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 06:06:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:41,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:41,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:41,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606777634] [2025-03-17 06:06:41,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606777634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:41,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:41,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241532427] [2025-03-17 06:06:41,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:41,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:41,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:41,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:41,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:41,015 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:41,323 INFO L93 Difference]: Finished difference Result 173 states and 249 transitions. [2025-03-17 06:06:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:41,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2025-03-17 06:06:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:41,328 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:06:41,328 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:06:41,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:41,329 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:41,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:06:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:06:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:06:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-03-17 06:06:41,337 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 85 [2025-03-17 06:06:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:41,338 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-03-17 06:06:41,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-03-17 06:06:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:41,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:41,340 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:41,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:41,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-17 06:06:41,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:41,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1957019963, now seen corresponding path program 1 times [2025-03-17 06:06:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:41,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276078537] [2025-03-17 06:06:41,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:41,543 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-03-17 06:06:41,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:41,545 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-17 06:06:41,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:41,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:41,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:41,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:41,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:41,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:06:41,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:41,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:41,871 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:41,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276078537] [2025-03-17 06:06:41,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276078537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:41,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:41,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:06:41,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39585092] [2025-03-17 06:06:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:41,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:06:41,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:41,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:06:41,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:06:41,872 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:41,918 INFO L93 Difference]: Finished difference Result 178 states and 254 transitions. [2025-03-17 06:06:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:06:41,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2025-03-17 06:06:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:41,919 INFO L225 Difference]: With dead ends: 178 [2025-03-17 06:06:41,920 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 06:06:41,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:06:41,921 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:41,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 06:06:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-17 06:06:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-03-17 06:06:41,925 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 85 [2025-03-17 06:06:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:41,925 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-03-17 06:06:41,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-03-17 06:06:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 06:06:41,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:41,927 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:41,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:42,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-17 06:06:42,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:42,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1957943484, now seen corresponding path program 1 times [2025-03-17 06:06:42,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:42,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182854667] [2025-03-17 06:06:42,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:42,129 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-03-17 06:06:42,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:42,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-17 06:06:42,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:42,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 06:06:42,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 06:06:42,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:42,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:42,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:06:42,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:42,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:06:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 06:06:42,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:42,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:42,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182854667] [2025-03-17 06:06:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182854667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:42,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:42,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:06:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484446706] [2025-03-17 06:06:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:42,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:06:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:42,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:06:42,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:06:42,505 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:43,268 INFO L93 Difference]: Finished difference Result 181 states and 255 transitions. [2025-03-17 06:06:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:06:43,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-17 06:06:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:43,269 INFO L225 Difference]: With dead ends: 181 [2025-03-17 06:06:43,269 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 06:06:43,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:06:43,271 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 112 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:43,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 364 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:06:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 06:06:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-17 06:06:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 78 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2025-03-17 06:06:43,278 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 85 [2025-03-17 06:06:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:43,278 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2025-03-17 06:06:43,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 06:06:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2025-03-17 06:06:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 06:06:43,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:43,279 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:43,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:43,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-03-17 06:06:43,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:43,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:43,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1965575621, now seen corresponding path program 1 times [2025-03-17 06:06:43,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:43,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639381957] [2025-03-17 06:06:43,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:43,481 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-03-17 06:06:43,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:43,483 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-03-17 06:06:43,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:06:43,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 06:06:43,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 06:06:43,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:43,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:43,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:06:43,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:43,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2025-03-17 06:06:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 06:06:43,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:06:44,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2025-03-17 06:06:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 06:06:44,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:44,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639381957] [2025-03-17 06:06:44,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639381957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:06:44,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:06:44,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-17 06:06:44,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209009130] [2025-03-17 06:06:44,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:06:44,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:06:44,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:44,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:06:44,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:06:44,053 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 06:06:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:44,922 INFO L93 Difference]: Finished difference Result 190 states and 264 transitions. [2025-03-17 06:06:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:06:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 87 [2025-03-17 06:06:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:44,924 INFO L225 Difference]: With dead ends: 190 [2025-03-17 06:06:44,924 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 06:06:44,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:06:44,926 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 125 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:44,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 430 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:06:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 06:06:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-17 06:06:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2025-03-17 06:06:44,933 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 87 [2025-03-17 06:06:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:44,933 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2025-03-17 06:06:44,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 06:06:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2025-03-17 06:06:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 06:06:44,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:44,937 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:44,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 06:06:45,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-03-17 06:06:45,137 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:45,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:45,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1010054342, now seen corresponding path program 1 times [2025-03-17 06:06:45,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:45,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624743398] [2025-03-17 06:06:45,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:45,138 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-03-17 06:06:45,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:45,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-03-17 06:06:45,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 06:06:45,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 06:06:45,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 06:06:45,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:45,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:45,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:45,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:45,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-03-17 06:06:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:45,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:45,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:45,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624743398] [2025-03-17 06:06:45,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624743398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:45,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:45,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820539699] [2025-03-17 06:06:45,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:45,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:45,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:45,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:45,497 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:45,772 INFO L93 Difference]: Finished difference Result 175 states and 243 transitions. [2025-03-17 06:06:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:45,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2025-03-17 06:06:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:45,775 INFO L225 Difference]: With dead ends: 175 [2025-03-17 06:06:45,775 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:06:45,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:45,775 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:45,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:06:45,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:06:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:06:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2025-03-17 06:06:45,783 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 87 [2025-03-17 06:06:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:45,783 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2025-03-17 06:06:45,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2025-03-17 06:06:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 06:06:45,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:45,784 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:45,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 06:06:45,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-03-17 06:06:45,985 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:45,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash 299397575, now seen corresponding path program 1 times [2025-03-17 06:06:45,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:45,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932130168] [2025-03-17 06:06:45,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:45,986 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-03-17 06:06:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:45,989 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-03-17 06:06:45,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 06:06:46,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 06:06:46,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 06:06:46,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:46,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:46,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:46,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 06:06:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:46,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:46,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:46,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932130168] [2025-03-17 06:06:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932130168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:46,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:46,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824865015] [2025-03-17 06:06:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:46,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:46,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:46,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:46,340 INFO L87 Difference]: Start difference. First operand 87 states and 120 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:46,725 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2025-03-17 06:06:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:46,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-17 06:06:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:46,726 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:06:46,726 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:06:46,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:46,727 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:46,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:06:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:06:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:06:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-03-17 06:06:46,731 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 92 [2025-03-17 06:06:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:46,732 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-03-17 06:06:46,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-03-17 06:06:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 06:06:46,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:46,732 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:46,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 06:06:46,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-03-17 06:06:46,937 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:46,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1777811768, now seen corresponding path program 1 times [2025-03-17 06:06:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059605393] [2025-03-17 06:06:46,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:46,938 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-03-17 06:06:46,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:46,940 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-03-17 06:06:46,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (10)] Waiting until timeout for monitored process [2025-03-17 06:06:47,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 06:06:47,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 06:06:47,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:47,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:47,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:47,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:47,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 06:06:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:47,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:47,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059605393] [2025-03-17 06:06:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059605393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534576946] [2025-03-17 06:06:47,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:47,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:47,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:47,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:47,341 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:47,604 INFO L93 Difference]: Finished difference Result 173 states and 237 transitions. [2025-03-17 06:06:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:47,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-17 06:06:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:47,606 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:06:47,606 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:06:47,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:47,607 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:47,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:06:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:06:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:06:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2025-03-17 06:06:47,614 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 92 [2025-03-17 06:06:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:47,615 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2025-03-17 06:06:47,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2025-03-17 06:06:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 06:06:47,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:47,616 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:47,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (10)] Forceful destruction successful, exit code 0 [2025-03-17 06:06:47,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-03-17 06:06:47,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:47,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash -533047287, now seen corresponding path program 1 times [2025-03-17 06:06:47,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:47,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059671331] [2025-03-17 06:06:47,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:47,818 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-03-17 06:06:47,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:47,820 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-03-17 06:06:47,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (11)] Waiting until timeout for monitored process [2025-03-17 06:06:47,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 06:06:48,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 06:06:48,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:48,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:48,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:48,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:48,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 06:06:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:48,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:48,167 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059671331] [2025-03-17 06:06:48,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059671331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:48,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:48,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430901884] [2025-03-17 06:06:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:48,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:48,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:48,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:48,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:48,168 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:48,473 INFO L93 Difference]: Finished difference Result 173 states and 235 transitions. [2025-03-17 06:06:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:48,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-17 06:06:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:48,474 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:06:48,474 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:06:48,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:48,475 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:48,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:06:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:06:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:06:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2025-03-17 06:06:48,481 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 92 [2025-03-17 06:06:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:48,482 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2025-03-17 06:06:48,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2025-03-17 06:06:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 06:06:48,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:48,483 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:48,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (11)] Ended with exit code 0 [2025-03-17 06:06:48,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-03-17 06:06:48,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:48,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:48,685 INFO L85 PathProgramCache]: Analyzing trace with hash -321696374, now seen corresponding path program 1 times [2025-03-17 06:06:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:48,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086912433] [2025-03-17 06:06:48,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:48,685 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-03-17 06:06:48,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:48,687 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/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-03-17 06:06:48,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (12)] Waiting until timeout for monitored process [2025-03-17 06:06:48,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 06:06:48,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 06:06:48,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:48,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:49,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:49,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:49,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 06:06:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:49,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:49,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:49,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086912433] [2025-03-17 06:06:49,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086912433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:49,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:49,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771085370] [2025-03-17 06:06:49,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:49,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:49,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:49,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:49,034 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:49,050 INFO L93 Difference]: Finished difference Result 173 states and 233 transitions. [2025-03-17 06:06:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:49,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-17 06:06:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:49,051 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:06:49,051 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:06:49,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:49,052 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:49,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:06:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:06:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 76 states have internal predecessors, (98), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2025-03-17 06:06:49,061 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 92 [2025-03-17 06:06:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:49,061 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2025-03-17 06:06:49,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2025-03-17 06:06:49,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 06:06:49,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:49,062 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:49,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (12)] Ended with exit code 0 [2025-03-17 06:06:49,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/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-03-17 06:06:49,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:49,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:49,263 INFO L85 PathProgramCache]: Analyzing trace with hash -827254999, now seen corresponding path program 1 times [2025-03-17 06:06:49,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:49,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279335658] [2025-03-17 06:06:49,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:49,263 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-03-17 06:06:49,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:49,265 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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-03-17 06:06:49,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (13)] Waiting until timeout for monitored process [2025-03-17 06:06:49,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 06:06:49,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 06:06:49,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:49,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:49,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:49,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:49,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-03-17 06:06:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:49,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:49,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:49,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279335658] [2025-03-17 06:06:49,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279335658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:49,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:49,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:49,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486699598] [2025-03-17 06:06:49,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:49,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:49,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:49,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:49,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:49,614 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:49,627 INFO L93 Difference]: Finished difference Result 171 states and 229 transitions. [2025-03-17 06:06:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:49,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-17 06:06:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:49,628 INFO L225 Difference]: With dead ends: 171 [2025-03-17 06:06:49,628 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:06:49,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:49,629 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:49,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:06:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 06:06:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 113 transitions. [2025-03-17 06:06:49,633 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 113 transitions. Word has length 92 [2025-03-17 06:06:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:49,634 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 113 transitions. [2025-03-17 06:06:49,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2025-03-17 06:06:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 06:06:49,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:49,634 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:49,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (13)] Forceful destruction successful, exit code 0 [2025-03-17 06:06:49,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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-03-17 06:06:49,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:49,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1003660866, now seen corresponding path program 1 times [2025-03-17 06:06:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:49,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310694623] [2025-03-17 06:06:49,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:49,836 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-03-17 06:06:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:49,838 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/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-03-17 06:06:49,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (14)] Waiting until timeout for monitored process [2025-03-17 06:06:49,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 06:06:50,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 06:06:50,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:50,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:50,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:50,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:50,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 06:06:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:50,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:50,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:50,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310694623] [2025-03-17 06:06:50,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310694623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:50,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:50,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377816943] [2025-03-17 06:06:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:50,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:50,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:50,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:50,228 INFO L87 Difference]: Start difference. First operand 85 states and 113 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:50,244 INFO L93 Difference]: Finished difference Result 169 states and 225 transitions. [2025-03-17 06:06:50,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:50,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-03-17 06:06:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:50,245 INFO L225 Difference]: With dead ends: 169 [2025-03-17 06:06:50,246 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:06:50,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:50,246 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:50,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:06:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 06:06:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2025-03-17 06:06:50,251 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 97 [2025-03-17 06:06:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:50,251 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2025-03-17 06:06:50,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2025-03-17 06:06:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 06:06:50,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:50,252 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:50,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (14)] Ended with exit code 0 [2025-03-17 06:06:50,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/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-03-17 06:06:50,456 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:50,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash 159188995, now seen corresponding path program 1 times [2025-03-17 06:06:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092313004] [2025-03-17 06:06:50,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:50,457 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-03-17 06:06:50,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:50,460 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/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-03-17 06:06:50,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (15)] Waiting until timeout for monitored process [2025-03-17 06:06:50,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 06:06:50,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 06:06:50,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:50,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:50,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:50,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:50,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 06:06:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:50,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:50,837 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:50,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092313004] [2025-03-17 06:06:50,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092313004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:50,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286296955] [2025-03-17 06:06:50,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:50,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:50,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:50,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:50,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:50,839 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:50,852 INFO L93 Difference]: Finished difference Result 169 states and 223 transitions. [2025-03-17 06:06:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:50,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-03-17 06:06:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:50,853 INFO L225 Difference]: With dead ends: 169 [2025-03-17 06:06:50,853 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:06:50,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:50,854 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:50,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:06:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 06:06:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2025-03-17 06:06:50,857 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 97 [2025-03-17 06:06:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:50,857 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2025-03-17 06:06:50,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2025-03-17 06:06:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 06:06:50,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:50,858 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:50,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (15)] Ended with exit code 0 [2025-03-17 06:06:51,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/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-03-17 06:06:51,059 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:51,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1512498692, now seen corresponding path program 1 times [2025-03-17 06:06:51,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:51,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167113488] [2025-03-17 06:06:51,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:51,060 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-03-17 06:06:51,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:51,061 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/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-03-17 06:06:51,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (16)] Waiting until timeout for monitored process [2025-03-17 06:06:51,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 06:06:51,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 06:06:51,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:51,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:51,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:51,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:51,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 06:06:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:06:51,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:51,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:51,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167113488] [2025-03-17 06:06:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167113488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:51,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:51,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771061284] [2025-03-17 06:06:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:51,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:51,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:51,462 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:51,480 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2025-03-17 06:06:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:51,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-03-17 06:06:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:51,481 INFO L225 Difference]: With dead ends: 169 [2025-03-17 06:06:51,482 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:06:51,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:51,483 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:51,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:06:51,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 06:06:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 06:06:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2025-03-17 06:06:51,488 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 97 [2025-03-17 06:06:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:51,488 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2025-03-17 06:06:51,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 06:06:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2025-03-17 06:06:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 06:06:51,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:51,489 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:06:51,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (16)] Ended with exit code 0 [2025-03-17 06:06:51,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/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-03-17 06:06:51,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:51,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1274916795, now seen corresponding path program 1 times [2025-03-17 06:06:51,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:51,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5161593] [2025-03-17 06:06:51,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:51,691 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-03-17 06:06:51,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:51,692 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/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-03-17 06:06:51,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (17)] Waiting until timeout for monitored process [2025-03-17 06:06:51,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.