./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-22.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-ap_file-22.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 317ab82921040837f96c3a255c065cf795671be004f9631757f4d0ec32d02a90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:32:21,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:32:21,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:32:21,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:32:21,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:32:21,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:32:21,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:32:22,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:32:22,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:32:22,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:32:22,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:32:22,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:32:22,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:32:22,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:32:22,002 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:32:22,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:32:22,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:32:22,002 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:32:22,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:32:22,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:32:22,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:32:22,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:32:22,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:32:22,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:32:22,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:32:22,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:32:22,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:32:22,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:32:22,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:32:22,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:32:22,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:32:22,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:32:22,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:32:22,004 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 -> 317ab82921040837f96c3a255c065cf795671be004f9631757f4d0ec32d02a90 [2025-03-17 05:32:22,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:32:22,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:32:22,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:32:22,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:32:22,246 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:32:22,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-22.i [2025-03-17 05:32:23,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b730a5fa/beb01fefa7d74981a8f8ed7723f03bc6/FLAG3aa9ff383 [2025-03-17 05:32:23,663 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:32:23,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-22.i [2025-03-17 05:32:23,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b730a5fa/beb01fefa7d74981a8f8ed7723f03bc6/FLAG3aa9ff383 [2025-03-17 05:32:23,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b730a5fa/beb01fefa7d74981a8f8ed7723f03bc6 [2025-03-17 05:32:23,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:32:23,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:32:23,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:32:23,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:32:23,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:32:23,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:23,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e85379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23, skipping insertion in model container [2025-03-17 05:32:23,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:23,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:32:23,822 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-ap_file-22.i[917,930] [2025-03-17 05:32:23,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:32:23,888 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:32:23,897 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-ap_file-22.i[917,930] [2025-03-17 05:32:23,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:32:23,936 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:32:23,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23 WrapperNode [2025-03-17 05:32:23,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:32:23,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:32:23,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:32:23,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:32:23,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:23,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:23,996 INFO L138 Inliner]: procedures = 29, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2025-03-17 05:32:23,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:32:23,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:32:23,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:32:23,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:32:24,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,027 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2025-03-17 05:32:24,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:32:24,063 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:32:24,063 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:32:24,063 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:32:24,064 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (1/1) ... [2025-03-17 05:32:24,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:32:24,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:32:24,093 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 05:32:24,095 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 05:32:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:32:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:32:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:32:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:32:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:32:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:32:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:32:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:32:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:32:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:32:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:32:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:32:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:32:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:32:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:32:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:32:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:32:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:32:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:32:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:32:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:32:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:32:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:32:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:32:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:32:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:32:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:32:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:32:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:32:24,243 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:32:24,245 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:32:24,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem68#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem70#1;havoc property_#t~mem74#1;havoc property_#t~ite81#1;havoc property_#t~mem75#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~short82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~bitwise92#1;havoc property_#t~ite107#1;havoc property_#t~mem102#1;havoc property_#t~mem93#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-03-17 05:32:24,629 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-03-17 05:32:24,629 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:32:24,644 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:32:24,644 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:32:24,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:32:24 BoogieIcfgContainer [2025-03-17 05:32:24,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:32:24,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:32:24,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:32:24,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:32:24,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:32:23" (1/3) ... [2025-03-17 05:32:24,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375fda33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:32:24, skipping insertion in model container [2025-03-17 05:32:24,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:23" (2/3) ... [2025-03-17 05:32:24,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375fda33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:32:24, skipping insertion in model container [2025-03-17 05:32:24,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:32:24" (3/3) ... [2025-03-17 05:32:24,652 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-22.i [2025-03-17 05:32:24,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:32:24,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-22.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:32:24,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:32:24,712 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;@1a41ff0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:32:24,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:32:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 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 05:32:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:32:24,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:24,722 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] [2025-03-17 05:32:24,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:24,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:24,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1747310667, now seen corresponding path program 1 times [2025-03-17 05:32:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241871166] [2025-03-17 05:32:24,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:24,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:24,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:32:24,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:32:24,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:24,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:24,926 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 05:32:24,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:24,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241871166] [2025-03-17 05:32:24,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241871166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:32:24,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125342384] [2025-03-17 05:32:24,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:24,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:32:24,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:32:24,931 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 05:32:24,933 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 05:32:25,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:32:25,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:32:25,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:25,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:25,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:32:25,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:32:25,140 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 05:32:25,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:32:25,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125342384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:25,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:32:25,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:32:25,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449921068] [2025-03-17 05:32:25,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:25,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:32:25,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:25,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:32:25,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:32:25,165 INFO L87 Difference]: Start difference. First operand has 99 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 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.0) internal successors, (46), 2 states have internal predecessors, (46), 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 05:32:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:25,187 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2025-03-17 05:32:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:32:25,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 86 [2025-03-17 05:32:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:25,194 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:32:25,195 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 05:32:25,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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 05:32:25,199 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:25,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 05:32:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 05:32:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 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 05:32:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2025-03-17 05:32:25,231 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 86 [2025-03-17 05:32:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:25,231 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2025-03-17 05:32:25,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 05:32:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2025-03-17 05:32:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:32:25,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:25,234 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] [2025-03-17 05:32:25,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:32:25,435 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 05:32:25,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:25,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash -752290770, now seen corresponding path program 1 times [2025-03-17 05:32:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556800802] [2025-03-17 05:32:25,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:25,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:25,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:32:25,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:32:25,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:25,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:26,164 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 05:32:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:26,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556800802] [2025-03-17 05:32:26,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556800802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:26,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:26,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:32:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679470360] [2025-03-17 05:32:26,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:26,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:32:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:26,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:32:26,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:32:26,167 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 05:32:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:26,870 INFO L93 Difference]: Finished difference Result 481 states and 702 transitions. [2025-03-17 05:32:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:32:26,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 86 [2025-03-17 05:32:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:26,874 INFO L225 Difference]: With dead ends: 481 [2025-03-17 05:32:26,874 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 05:32:26,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:32:26,875 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 347 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:26,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 752 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:32:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 05:32:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 267. [2025-03-17 05:32:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 238 states have (on average 1.4327731092436975) internal successors, (341), 239 states have internal predecessors, (341), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:32:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 391 transitions. [2025-03-17 05:32:26,909 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 391 transitions. Word has length 86 [2025-03-17 05:32:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:26,910 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 391 transitions. [2025-03-17 05:32:26,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 05:32:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 391 transitions. [2025-03-17 05:32:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:32:26,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:26,912 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 05:32:26,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:32:26,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:26,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash 817254775, now seen corresponding path program 1 times [2025-03-17 05:32:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:26,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654442983] [2025-03-17 05:32:26,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:26,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:32:26,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:32:26,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:26,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:26,994 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 05:32:26,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654442983] [2025-03-17 05:32:26,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654442983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:26,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:32:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524861809] [2025-03-17 05:32:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:26,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:32:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:26,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:32:26,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:32:26,996 INFO L87 Difference]: Start difference. First operand 267 states and 391 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 05:32:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:27,018 INFO L93 Difference]: Finished difference Result 551 states and 809 transitions. [2025-03-17 05:32:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:32:27,019 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 05:32:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:27,021 INFO L225 Difference]: With dead ends: 551 [2025-03-17 05:32:27,021 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 05:32:27,022 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 05:32:27,023 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 28 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:27,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 270 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 05:32:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 267. [2025-03-17 05:32:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 238 states have (on average 1.4243697478991597) internal successors, (339), 239 states have internal predecessors, (339), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:32:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 389 transitions. [2025-03-17 05:32:27,052 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 389 transitions. Word has length 87 [2025-03-17 05:32:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:27,052 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 389 transitions. [2025-03-17 05:32:27,052 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 05:32:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 389 transitions. [2025-03-17 05:32:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:32:27,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:27,056 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] [2025-03-17 05:32:27,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:32:27,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:27,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2011034114, now seen corresponding path program 1 times [2025-03-17 05:32:27,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:27,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032175464] [2025-03-17 05:32:27,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:27,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:27,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:32:27,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:32:27,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:27,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:27,130 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 05:32:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:27,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032175464] [2025-03-17 05:32:27,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032175464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:27,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:27,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:32:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717973989] [2025-03-17 05:32:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:27,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:32:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:27,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:32:27,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:32:27,131 INFO L87 Difference]: Start difference. First operand 267 states and 389 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 05:32:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:27,181 INFO L93 Difference]: Finished difference Result 423 states and 615 transitions. [2025-03-17 05:32:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:32:27,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 88 [2025-03-17 05:32:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:27,186 INFO L225 Difference]: With dead ends: 423 [2025-03-17 05:32:27,186 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 05:32:27,186 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 05:32:27,187 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:27,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 05:32:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2025-03-17 05:32:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:32:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2025-03-17 05:32:27,199 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 88 [2025-03-17 05:32:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:27,200 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2025-03-17 05:32:27,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 05:32:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2025-03-17 05:32:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 05:32:27,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:27,201 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] [2025-03-17 05:32:27,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:32:27,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:27,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:27,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1642986812, now seen corresponding path program 1 times [2025-03-17 05:32:27,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:27,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726827277] [2025-03-17 05:32:27,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:27,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:27,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 05:32:27,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 05:32:27,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:27,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:32:27,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726827277] [2025-03-17 05:32:27,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726827277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:32:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77705551] [2025-03-17 05:32:27,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:27,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:32:27,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:32:27,810 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 05:32:27,811 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 05:32:27,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 05:32:27,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 05:32:27,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:27,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:27,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:32:27,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:32:28,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-17 05:32:28,554 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2025-03-17 05:32:28,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2025-03-17 05:32:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:32:28,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:32:29,087 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 05:32:29,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77705551] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:32:29,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:32:29,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 9] total 21 [2025-03-17 05:32:29,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114014641] [2025-03-17 05:32:29,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:29,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:32:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:29,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:32:29,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:32:29,089 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 05:32:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:29,264 INFO L93 Difference]: Finished difference Result 325 states and 466 transitions. [2025-03-17 05:32:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:32:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 91 [2025-03-17 05:32:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:29,266 INFO L225 Difference]: With dead ends: 325 [2025-03-17 05:32:29,266 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 05:32:29,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:32:29,267 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 109 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:29,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 687 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:32:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 05:32:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2025-03-17 05:32:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 198 states have (on average 1.393939393939394) internal successors, (276), 199 states have internal predecessors, (276), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:32:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 326 transitions. [2025-03-17 05:32:29,281 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 326 transitions. Word has length 91 [2025-03-17 05:32:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:29,282 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 326 transitions. [2025-03-17 05:32:29,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 05:32:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 326 transitions. [2025-03-17 05:32:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:32:29,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:29,285 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 05:32:29,292 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 05:32:29,485 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 05:32:29,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:29,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash -189041223, now seen corresponding path program 1 times [2025-03-17 05:32:29,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:29,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596403109] [2025-03-17 05:32:29,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:29,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:32:29,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:32:29,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:29,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:29,867 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 05:32:29,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:29,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596403109] [2025-03-17 05:32:29,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596403109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:29,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:29,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:32:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160392684] [2025-03-17 05:32:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:29,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:32:29,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:29,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:32:29,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:32:29,869 INFO L87 Difference]: Start difference. First operand 227 states and 326 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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 05:32:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:30,083 INFO L93 Difference]: Finished difference Result 690 states and 990 transitions. [2025-03-17 05:32:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:32:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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 05:32:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:30,085 INFO L225 Difference]: With dead ends: 690 [2025-03-17 05:32:30,085 INFO L226 Difference]: Without dead ends: 508 [2025-03-17 05:32:30,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:32:30,086 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 374 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:30,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1012 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:32:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-17 05:32:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 318. [2025-03-17 05:32:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 279 states have (on average 1.3978494623655915) internal successors, (390), 280 states have internal predecessors, (390), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:32:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 458 transitions. [2025-03-17 05:32:30,123 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 458 transitions. Word has length 92 [2025-03-17 05:32:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:30,124 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 458 transitions. [2025-03-17 05:32:30,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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 05:32:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 458 transitions. [2025-03-17 05:32:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:32:30,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:30,125 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] [2025-03-17 05:32:30,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:32:30,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:30,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash -157846636, now seen corresponding path program 1 times [2025-03-17 05:32:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:30,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149394055] [2025-03-17 05:32:30,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:30,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:32:30,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:32:30,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:30,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:30,393 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 05:32:30,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149394055] [2025-03-17 05:32:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149394055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:30,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:32:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064088636] [2025-03-17 05:32:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:30,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:32:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:30,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:32:30,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:32:30,395 INFO L87 Difference]: Start difference. First operand 318 states and 458 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 05:32:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:30,692 INFO L93 Difference]: Finished difference Result 900 states and 1297 transitions. [2025-03-17 05:32:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:32:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 93 [2025-03-17 05:32:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:30,695 INFO L225 Difference]: With dead ends: 900 [2025-03-17 05:32:30,695 INFO L226 Difference]: Without dead ends: 627 [2025-03-17 05:32:30,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:32:30,696 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 240 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:30,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 587 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:32:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-17 05:32:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 333. [2025-03-17 05:32:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 294 states have (on average 1.3877551020408163) internal successors, (408), 295 states have internal predecessors, (408), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:32:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 476 transitions. [2025-03-17 05:32:30,716 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 476 transitions. Word has length 93 [2025-03-17 05:32:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:30,717 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 476 transitions. [2025-03-17 05:32:30,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 05:32:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 476 transitions. [2025-03-17 05:32:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:32:30,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:30,718 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] [2025-03-17 05:32:30,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:32:30,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:30,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:30,719 INFO L85 PathProgramCache]: Analyzing trace with hash -126826829, now seen corresponding path program 1 times [2025-03-17 05:32:30,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:30,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340153971] [2025-03-17 05:32:30,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:30,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:32:30,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:32:30,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:30,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:31,456 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 05:32:31,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:31,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340153971] [2025-03-17 05:32:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340153971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:31,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:31,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:32:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585457633] [2025-03-17 05:32:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:31,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:32:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:31,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:32:31,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:32:31,458 INFO L87 Difference]: Start difference. First operand 333 states and 476 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 05:32:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:32,132 INFO L93 Difference]: Finished difference Result 815 states and 1165 transitions. [2025-03-17 05:32:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:32:32,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 93 [2025-03-17 05:32:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:32,135 INFO L225 Difference]: With dead ends: 815 [2025-03-17 05:32:32,135 INFO L226 Difference]: Without dead ends: 542 [2025-03-17 05:32:32,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:32:32,136 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 276 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:32,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1120 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:32:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-17 05:32:32,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 347. [2025-03-17 05:32:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 307 states have (on average 1.3778501628664495) internal successors, (423), 308 states have internal predecessors, (423), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:32:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 491 transitions. [2025-03-17 05:32:32,152 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 491 transitions. Word has length 93 [2025-03-17 05:32:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:32,152 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 491 transitions. [2025-03-17 05:32:32,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 05:32:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 491 transitions. [2025-03-17 05:32:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:32:32,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:32,153 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] [2025-03-17 05:32:32,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:32:32,153 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:32,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1260067806, now seen corresponding path program 1 times [2025-03-17 05:32:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:32,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348929120] [2025-03-17 05:32:32,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:32,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:32,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:32:32,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:32:32,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:32,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:32,536 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 05:32:32,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348929120] [2025-03-17 05:32:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348929120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:32:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523402019] [2025-03-17 05:32:32,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:32,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:32:32,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:32,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:32:32,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:32:32,538 INFO L87 Difference]: Start difference. First operand 347 states and 491 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 05:32:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:32,771 INFO L93 Difference]: Finished difference Result 685 states and 972 transitions. [2025-03-17 05:32:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:32:32,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 93 [2025-03-17 05:32:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:32,774 INFO L225 Difference]: With dead ends: 685 [2025-03-17 05:32:32,774 INFO L226 Difference]: Without dead ends: 507 [2025-03-17 05:32:32,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:32:32,775 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 276 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:32,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1055 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:32:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-17 05:32:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 372. [2025-03-17 05:32:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 332 states have (on average 1.3795180722891567) internal successors, (458), 333 states have internal predecessors, (458), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:32:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 526 transitions. [2025-03-17 05:32:32,790 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 526 transitions. Word has length 93 [2025-03-17 05:32:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:32,790 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 526 transitions. [2025-03-17 05:32:32,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 05:32:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 526 transitions. [2025-03-17 05:32:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:32:32,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:32,791 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] [2025-03-17 05:32:32,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:32:32,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:32,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash 790854279, now seen corresponding path program 1 times [2025-03-17 05:32:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934088349] [2025-03-17 05:32:32,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:32,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:32:32,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:32:32,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:32,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:33,058 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 05:32:33,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934088349] [2025-03-17 05:32:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934088349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:33,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:33,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:32:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440272455] [2025-03-17 05:32:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:33,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:32:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:33,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:32:33,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:32:33,060 INFO L87 Difference]: Start difference. First operand 372 states and 526 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 05:32:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:33,272 INFO L93 Difference]: Finished difference Result 722 states and 1024 transitions. [2025-03-17 05:32:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:32:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 93 [2025-03-17 05:32:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:33,274 INFO L225 Difference]: With dead ends: 722 [2025-03-17 05:32:33,274 INFO L226 Difference]: Without dead ends: 536 [2025-03-17 05:32:33,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:32:33,275 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 358 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:33,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 991 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:32:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-17 05:32:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 368. [2025-03-17 05:32:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 328 states have (on average 1.375) internal successors, (451), 329 states have internal predecessors, (451), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:32:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 519 transitions. [2025-03-17 05:32:33,292 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 519 transitions. Word has length 93 [2025-03-17 05:32:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:33,292 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 519 transitions. [2025-03-17 05:32:33,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 05:32:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 519 transitions. [2025-03-17 05:32:33,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:32:33,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:33,293 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] [2025-03-17 05:32:33,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:32:33,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:33,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:33,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1207085614, now seen corresponding path program 1 times [2025-03-17 05:32:33,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:33,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756464145] [2025-03-17 05:32:33,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:33,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:32:33,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:32:33,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:33,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:33,402 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 05:32:33,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:33,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756464145] [2025-03-17 05:32:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756464145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:33,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:32:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801867833] [2025-03-17 05:32:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:33,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:32:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:33,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:32:33,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:32:33,404 INFO L87 Difference]: Start difference. First operand 368 states and 519 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 05:32:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:33,453 INFO L93 Difference]: Finished difference Result 651 states and 926 transitions. [2025-03-17 05:32:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:32:33,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 94 [2025-03-17 05:32:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:33,455 INFO L225 Difference]: With dead ends: 651 [2025-03-17 05:32:33,455 INFO L226 Difference]: Without dead ends: 468 [2025-03-17 05:32:33,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:32:33,456 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 75 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:33,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 608 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-17 05:32:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 366. [2025-03-17 05:32:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 326 states have (on average 1.3711656441717792) internal successors, (447), 327 states have internal predecessors, (447), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:32:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 515 transitions. [2025-03-17 05:32:33,471 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 515 transitions. Word has length 94 [2025-03-17 05:32:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:33,471 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 515 transitions. [2025-03-17 05:32:33,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 05:32:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 515 transitions. [2025-03-17 05:32:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:32:33,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:33,472 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] [2025-03-17 05:32:33,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:32:33,472 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:33,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1843117201, now seen corresponding path program 1 times [2025-03-17 05:32:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427347502] [2025-03-17 05:32:33,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:33,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:33,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:32:33,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:32:33,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:33,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:33,592 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 05:32:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427347502] [2025-03-17 05:32:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427347502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:33,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:33,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:32:33,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957737404] [2025-03-17 05:32:33,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:33,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:32:33,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:33,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:32:33,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:32:33,594 INFO L87 Difference]: Start difference. First operand 366 states and 515 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 05:32:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:33,608 INFO L93 Difference]: Finished difference Result 486 states and 681 transitions. [2025-03-17 05:32:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:32:33,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 94 [2025-03-17 05:32:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:33,610 INFO L225 Difference]: With dead ends: 486 [2025-03-17 05:32:33,610 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 05:32:33,611 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 05:32:33,612 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:33,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 05:32:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-03-17 05:32:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.3121019108280254) internal successors, (206), 157 states have internal predecessors, (206), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:32:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 242 transitions. [2025-03-17 05:32:33,623 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 242 transitions. Word has length 94 [2025-03-17 05:32:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:33,623 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 242 transitions. [2025-03-17 05:32:33,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 05:32:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 242 transitions. [2025-03-17 05:32:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:32:33,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:33,624 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] [2025-03-17 05:32:33,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:32:33,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:33,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1181647473, now seen corresponding path program 1 times [2025-03-17 05:32:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:33,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414055885] [2025-03-17 05:32:33,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:33,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:33,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:32:33,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:32:33,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:33,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:33,747 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 05:32:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414055885] [2025-03-17 05:32:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414055885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:33,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:32:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051044656] [2025-03-17 05:32:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:33,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:32:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:33,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:32:33,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:32:33,749 INFO L87 Difference]: Start difference. First operand 180 states and 242 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 05:32:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:33,794 INFO L93 Difference]: Finished difference Result 335 states and 457 transitions. [2025-03-17 05:32:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:32:33,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 95 [2025-03-17 05:32:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:33,795 INFO L225 Difference]: With dead ends: 335 [2025-03-17 05:32:33,795 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 05:32:33,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:32:33,796 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 58 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:33,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 594 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 05:32:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 204. [2025-03-17 05:32:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.3204419889502763) internal successors, (239), 181 states have internal predecessors, (239), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:32:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 275 transitions. [2025-03-17 05:32:33,805 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 275 transitions. Word has length 95 [2025-03-17 05:32:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:33,805 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 275 transitions. [2025-03-17 05:32:33,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 05:32:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 275 transitions. [2025-03-17 05:32:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:32:33,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:33,806 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] [2025-03-17 05:32:33,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:32:33,807 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:33,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash 869274612, now seen corresponding path program 1 times [2025-03-17 05:32:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:33,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013930594] [2025-03-17 05:32:33,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:33,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:33,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:32:33,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:32:33,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:33,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:33,919 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 05:32:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013930594] [2025-03-17 05:32:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013930594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:32:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:32:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755333194] [2025-03-17 05:32:33,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:33,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:32:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:33,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:32:33,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:32:33,921 INFO L87 Difference]: Start difference. First operand 204 states and 275 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 05:32:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:33,965 INFO L93 Difference]: Finished difference Result 359 states and 489 transitions. [2025-03-17 05:32:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:32:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 95 [2025-03-17 05:32:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:33,966 INFO L225 Difference]: With dead ends: 359 [2025-03-17 05:32:33,967 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 05:32:33,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:32:33,967 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 59 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:33,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 596 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 05:32:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 204. [2025-03-17 05:32:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.3149171270718232) internal successors, (238), 181 states have internal predecessors, (238), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:32:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 274 transitions. [2025-03-17 05:32:33,977 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 274 transitions. Word has length 95 [2025-03-17 05:32:33,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:33,977 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 274 transitions. [2025-03-17 05:32:33,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 05:32:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 274 transitions. [2025-03-17 05:32:33,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:32:33,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:33,978 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] [2025-03-17 05:32:33,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:32:33,978 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash 998357331, now seen corresponding path program 1 times [2025-03-17 05:32:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:33,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762774194] [2025-03-17 05:32:33,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:33,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:32:33,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:32:33,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:33,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:32:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762774194] [2025-03-17 05:32:34,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762774194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:32:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832566167] [2025-03-17 05:32:34,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:34,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:32:34,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:32:34,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:32:34,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:32:34,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:32:34,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:32:34,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:34,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:34,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:32:34,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:32:34,252 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 05:32:34,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:32:34,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832566167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:32:34,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:32:34,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:32:34,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700168651] [2025-03-17 05:32:34,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:32:34,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:32:34,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:34,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:32:34,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:32:34,254 INFO L87 Difference]: Start difference. First operand 204 states and 274 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 05:32:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:34,281 INFO L93 Difference]: Finished difference Result 331 states and 449 transitions. [2025-03-17 05:32:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:32:34,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 95 [2025-03-17 05:32:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:34,283 INFO L225 Difference]: With dead ends: 331 [2025-03-17 05:32:34,283 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 05:32:34,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:32:34,285 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:34,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:32:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 05:32:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2025-03-17 05:32:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 180 states have (on average 1.3111111111111111) internal successors, (236), 180 states have internal predecessors, (236), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:32:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 272 transitions. [2025-03-17 05:32:34,295 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 272 transitions. Word has length 95 [2025-03-17 05:32:34,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:34,295 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 272 transitions. [2025-03-17 05:32:34,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 05:32:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 272 transitions. [2025-03-17 05:32:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:32:34,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:34,296 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] [2025-03-17 05:32:34,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:32:34,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:32:34,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:34,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -554972928, now seen corresponding path program 1 times [2025-03-17 05:32:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749499730] [2025-03-17 05:32:34,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:34,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:32:34,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:32:34,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:34,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:32:34,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749499730] [2025-03-17 05:32:34,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749499730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:32:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020303272] [2025-03-17 05:32:34,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:34,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:32:34,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:32:34,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:32:34,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:32:34,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:32:35,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:32:35,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:35,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:35,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 05:32:35,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:32:35,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:32:35,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 05:32:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 17 proven. 78 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 05:32:35,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:32:48,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020303272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:32:48,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:32:48,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2025-03-17 05:32:48,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692721434] [2025-03-17 05:32:48,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:32:48,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 05:32:48,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:48,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 05:32:48,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=874, Unknown=2, NotChecked=0, Total=1122 [2025-03-17 05:32:48,690 INFO L87 Difference]: Start difference. First operand 203 states and 272 transitions. Second operand has 23 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 7 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 05:32:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:49,492 INFO L93 Difference]: Finished difference Result 402 states and 536 transitions. [2025-03-17 05:32:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 05:32:49,493 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 7 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) Word has length 95 [2025-03-17 05:32:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:49,496 INFO L225 Difference]: With dead ends: 402 [2025-03-17 05:32:49,496 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 05:32:49,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=505, Invalid=1563, Unknown=2, NotChecked=0, Total=2070 [2025-03-17 05:32:49,498 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 163 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:49,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1035 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:32:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 05:32:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 219. [2025-03-17 05:32:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:32:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 288 transitions. [2025-03-17 05:32:49,509 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 288 transitions. Word has length 95 [2025-03-17 05:32:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:49,509 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 288 transitions. [2025-03-17 05:32:49,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 7 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 05:32:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 288 transitions. [2025-03-17 05:32:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:32:49,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:49,510 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] [2025-03-17 05:32:49,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:32:49,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 05:32:49,714 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:49,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1701938079, now seen corresponding path program 1 times [2025-03-17 05:32:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:49,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118702828] [2025-03-17 05:32:49,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:49,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:49,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:32:49,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:32:49,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:49,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:32:50,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:32:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118702828] [2025-03-17 05:32:50,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118702828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:32:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892175144] [2025-03-17 05:32:50,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:50,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:32:50,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:32:50,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:32:50,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:32:50,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:32:50,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:32:50,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:50,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:32:50,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 05:32:50,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:32:50,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:32:51,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:32:51,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 05:32:51,191 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 05:32:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 32 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:32:51,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:32:51,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892175144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:32:51,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:32:51,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2025-03-17 05:32:51,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821121899] [2025-03-17 05:32:51,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:32:51,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:32:51,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:32:51,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:32:51,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:32:51,386 INFO L87 Difference]: Start difference. First operand 219 states and 288 transitions. Second operand has 20 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 05:32:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:32:52,747 INFO L93 Difference]: Finished difference Result 406 states and 537 transitions. [2025-03-17 05:32:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 05:32:52,747 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 95 [2025-03-17 05:32:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:32:52,749 INFO L225 Difference]: With dead ends: 406 [2025-03-17 05:32:52,749 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 05:32:52,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 05:32:52,750 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 607 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:32:52,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1074 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:32:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 05:32:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 221. [2025-03-17 05:32:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 195 states have (on average 1.2820512820512822) internal successors, (250), 195 states have internal predecessors, (250), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:32:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 286 transitions. [2025-03-17 05:32:52,770 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 286 transitions. Word has length 95 [2025-03-17 05:32:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:32:52,770 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 286 transitions. [2025-03-17 05:32:52,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 05:32:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 286 transitions. [2025-03-17 05:32:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 05:32:52,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:32:52,772 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 05:32:52,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:32:52,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 05:32:52,972 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:32:52,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:32:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash 469252962, now seen corresponding path program 1 times [2025-03-17 05:32:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:32:52,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395211786] [2025-03-17 05:32:52,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:32:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:32:52,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 05:32:53,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 05:32:53,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:53,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:32:53,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:32:53,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 05:32:53,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 05:32:53,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:32:53,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:32:53,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:32:53,127 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:32:53,128 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:32:53,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:32:53,132 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:32:53,276 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:32:53,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:32:53 BoogieIcfgContainer [2025-03-17 05:32:53,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:32:53,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:32:53,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:32:53,280 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:32:53,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:32:24" (3/4) ... [2025-03-17 05:32:53,282 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:32:53,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:32:53,283 INFO L158 Benchmark]: Toolchain (without parser) took 29586.73ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 123.7MB in the beginning and 399.6MB in the end (delta: -275.9MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2025-03-17 05:32:53,284 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:32:53,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.14ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 108.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:32:53,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.49ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:32:53,284 INFO L158 Benchmark]: Boogie Preprocessor took 65.45ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 101.5MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:32:53,284 INFO L158 Benchmark]: IcfgBuilder took 581.08ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 66.0MB in the end (delta: 35.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:32:53,284 INFO L158 Benchmark]: TraceAbstraction took 28631.79ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 66.0MB in the beginning and 399.7MB in the end (delta: -333.7MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2025-03-17 05:32:53,285 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 545.3MB. Free memory was 399.7MB in the beginning and 399.6MB in the end (delta: 93.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:32:53,285 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.19ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.14ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 108.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.49ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.45ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 101.5MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 581.08ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 66.0MB in the end (delta: 35.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28631.79ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 66.0MB in the beginning and 399.7MB in the end (delta: -333.7MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 545.3MB. Free memory was 399.7MB in the beginning and 399.6MB in the end (delta: 93.2kB). 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 85, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of bitwiseAnd at line 67, overapproximation of someBinaryArithmeticFLOAToperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L26-L28] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L26-L28] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L26-L28] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L26-L28] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L29] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0][0]); [L30] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1][0]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[0][1]); [L32] float* float_Array_0_arrayfloat_Array_0arrayVar3_Pointer = &(float_Array_0[1][1]); [L33-L35] signed short int signed_short_int_Array_0[1] = { -5 }; [L33-L35] signed short int signed_short_int_Array_0[1] = { -5 }; [L36] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L40] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L41] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer = &(unsigned_long_int_Array_0[1]); [L42-L44] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L42-L44] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L42-L44] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L45] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L46] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L47] signed short int last_1_signed_short_int_Array_0_0_ = -5; [L48] unsigned long int last_1_unsigned_long_int_Array_0_1_ = 8; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L98] EXPR signed_short_int_Array_0[0] [L98] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L99] EXPR unsigned_long_int_Array_0[1] [L99] last_1_unsigned_long_int_Array_0_1_ = unsigned_long_int_Array_0[1] [L109] RET updateLastVariables() [L110] CALL updateVariables() [L81] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L84] float_Array_0[0][0] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[0][0] [L85] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F [L85] EXPR float_Array_0[0][0] [L85] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] CALL assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] RET assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] float_Array_0[1][0] = __VERIFIER_nondet_float() [L87] EXPR float_Array_0[1][0] [L87] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L87] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F [L87] EXPR float_Array_0[1][0] [L87] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L87] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L87] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L87] CALL assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L87] RET assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L88] float_Array_0[0][1] = __VERIFIER_nondet_float() [L89] EXPR float_Array_0[0][1] [L89] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F [L89] EXPR float_Array_0[0][1] [L89] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] CALL assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] RET assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L90] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L91] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L93] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L110] RET updateVariables() [L111] CALL step() [L52] signed long int stepLocal_0 = last_1_signed_short_int_Array_0_0_; [L53] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L53] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L54] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) = last_1_signed_short_int_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L60] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L60] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L60] COND TRUE (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) [L61] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L61] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) = ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16) [L67] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L67] EXPR (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) & last_1_unsigned_long_int_Array_0_1_ VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L67] COND TRUE last_1_unsigned_long_int_Array_0_1_ >= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) & last_1_unsigned_long_int_Array_0_1_) [L68] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L68] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) [L68] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L68] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L68] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) < (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_)) [L68] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L68] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) [L68] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L68] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) < (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L68] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) = ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) < (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_)))) [L76] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L76] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L76] COND TRUE (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) [L77] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L77] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L77] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L77] (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) = (((10.25f + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L102] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1) [L102] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L102] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L102] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1)) [L102] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1) [L102] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L102] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) == ((float) (((10.25f + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) == ((float) (((10.25f + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) : 1) [L102] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L102] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) == ((float) (((10.25f + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) : 1 [L102] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L102] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L102] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L102] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L102] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) == ((float) (((10.25f + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) == ((float) (((10.25f + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) == ((float) (((10.25f + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) & last_1_unsigned_long_int_Array_0_1_)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) < (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) == ((float) (((10.25f + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) & last_1_unsigned_long_int_Array_0_1_)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) < (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L102-L103] return (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + -16))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - 8)))))) : 1))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) == ((float) (((10.25f + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) & last_1_unsigned_long_int_Array_0_1_)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) < (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 156 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 18, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2971 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2970 mSDsluCounter, 11530 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8815 mSDsCounter, 381 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4550 IncrementalHoareTripleChecker+Invalid, 4931 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 381 mSolverCounterUnsat, 2715 mSDtfsCounter, 4550 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=9, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1403 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 2124 NumberOfCodeBlocks, 2124 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2095 ConstructedInterpolants, 66 QuantifiedInterpolants, 11065 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2008 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 3111/3312 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 05:32:53,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-ap_file-22.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 317ab82921040837f96c3a255c065cf795671be004f9631757f4d0ec32d02a90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:32:55,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:32:55,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:32:55,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:32:55,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:32:55,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:32:55,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:32:55,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:32:55,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:32:55,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:32:55,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:32:55,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:32:55,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:32:55,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:32:55,298 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:32:55,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:32:55,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:32:55,298 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:32:55,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:32:55,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:32:55,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:32:55,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:32:55,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:32:55,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:32:55,301 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 -> 317ab82921040837f96c3a255c065cf795671be004f9631757f4d0ec32d02a90 [2025-03-17 05:32:55,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:32:55,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:32:55,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:32:55,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:32:55,554 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:32:55,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-22.i [2025-03-17 05:32:56,743 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb0aec1da/10682ea25c6b4b3abad5165f920cf504/FLAGb79841918 [2025-03-17 05:32:56,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:32:56,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-22.i [2025-03-17 05:32:56,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb0aec1da/10682ea25c6b4b3abad5165f920cf504/FLAGb79841918 [2025-03-17 05:32:57,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb0aec1da/10682ea25c6b4b3abad5165f920cf504 [2025-03-17 05:32:57,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:32:57,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:32:57,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:32:57,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:32:57,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:32:57,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cd434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57, skipping insertion in model container [2025-03-17 05:32:57,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:32:57,438 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-ap_file-22.i[917,930] [2025-03-17 05:32:57,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:32:57,492 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:32:57,502 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-ap_file-22.i[917,930] [2025-03-17 05:32:57,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:32:57,544 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:32:57,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57 WrapperNode [2025-03-17 05:32:57,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:32:57,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:32:57,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:32:57,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:32:57,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,601 INFO L138 Inliner]: procedures = 36, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 407 [2025-03-17 05:32:57,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:32:57,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:32:57,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:32:57,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:32:57,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,647 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2025-03-17 05:32:57,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:32:57,690 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:32:57,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:32:57,690 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:32:57,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (1/1) ... [2025-03-17 05:32:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:32:57,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:32:57,715 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 05:32:57,717 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 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:32:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:32:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:32:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:32:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:32:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:32:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:32:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:32:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:32:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:32:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:32:57,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:32:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:32:57,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:32:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:32:57,889 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:32:57,891 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:33:00,118 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite72#1;havoc property_#t~mem67#1;havoc property_#t~mem66#1;havoc property_#t~mem68#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem74#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem75#1;havoc property_#t~ite77#1;havoc property_#t~mem76#1;havoc property_#t~short81#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~ite105#1;havoc property_#t~mem100#1;havoc property_#t~mem91#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~ite99#1;havoc property_#t~mem95#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short106#1; [2025-03-17 05:33:00,162 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-03-17 05:33:00,162 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:33:00,170 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:33:00,170 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:33:00,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:33:00 BoogieIcfgContainer [2025-03-17 05:33:00,170 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:33:00,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:33:00,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:33:00,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:33:00,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:32:57" (1/3) ... [2025-03-17 05:33:00,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac7faeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:33:00, skipping insertion in model container [2025-03-17 05:33:00,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:32:57" (2/3) ... [2025-03-17 05:33:00,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac7faeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:33:00, skipping insertion in model container [2025-03-17 05:33:00,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:33:00" (3/3) ... [2025-03-17 05:33:00,177 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-22.i [2025-03-17 05:33:00,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:33:00,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-22.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:33:00,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:33:00,236 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;@24364909, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:33:00,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:33:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 82 states have internal predecessors, (119), 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 05:33:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 05:33:00,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:00,247 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 05:33:00,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1489268858, now seen corresponding path program 1 times [2025-03-17 05:33:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:00,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897778418] [2025-03-17 05:33:00,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:00,259 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 05:33:00,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:00,265 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 05:33:00,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 (2)] Waiting until timeout for monitored process [2025-03-17 05:33:00,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 05:33:00,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 05:33:00,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:00,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:00,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:33:00,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 05:33:00,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:00,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:00,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897778418] [2025-03-17 05:33:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897778418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:00,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:33:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040053334] [2025-03-17 05:33:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:00,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:33:00,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:00,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:33:00,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:33:00,684 INFO L87 Difference]: Start difference. First operand has 93 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 82 states have internal predecessors, (119), 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 05:33:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:00,707 INFO L93 Difference]: Finished difference Result 180 states and 276 transitions. [2025-03-17 05:33:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:33:00,708 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 05:33:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:00,713 INFO L225 Difference]: With dead ends: 180 [2025-03-17 05:33:00,713 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:33:00,715 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 05:33:00,717 INFO L435 NwaCegarLoop]: 125 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, 125 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 05:33:00,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:33:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 05:33:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 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 05:33:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2025-03-17 05:33:00,747 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 85 [2025-03-17 05:33:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:00,748 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2025-03-17 05:33:00,748 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 05:33:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2025-03-17 05:33:00,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:33:00,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:00,750 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] [2025-03-17 05:33:00,760 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 05:33:00,953 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 05:33:00,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:00,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash -207750103, now seen corresponding path program 1 times [2025-03-17 05:33:00,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:00,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630728408] [2025-03-17 05:33:00,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:00,955 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 05:33:00,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:00,957 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 05:33:00,958 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 05:33:01,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:33:01,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:33:01,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:01,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:01,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:33:01,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 05:33:01,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:01,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630728408] [2025-03-17 05:33:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630728408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:01,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:01,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:33:01,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365969122] [2025-03-17 05:33:01,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:01,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:33:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:01,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:33:01,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:33:01,337 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 05:33:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:01,393 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2025-03-17 05:33:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:33:01,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 88 [2025-03-17 05:33:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:01,397 INFO L225 Difference]: With dead ends: 177 [2025-03-17 05:33:01,397 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 05:33:01,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 85 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 05:33:01,398 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:01,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 05:33:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 05:33:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 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 05:33:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2025-03-17 05:33:01,409 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 88 [2025-03-17 05:33:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:01,410 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2025-03-17 05:33:01,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 05:33:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2025-03-17 05:33:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:33:01,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:01,411 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] [2025-03-17 05:33:01,422 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 (3)] Ended with exit code 0 [2025-03-17 05:33:01,611 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 05:33:01,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:01,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1512143832, now seen corresponding path program 1 times [2025-03-17 05:33:01,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:01,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912485180] [2025-03-17 05:33:01,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:01,613 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 05:33:01,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:01,614 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 05:33:01,615 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 05:33:01,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:33:01,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:33:01,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:01,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:01,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:33:01,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:02,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 05:33:02,747 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-03-17 05:33:02,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 46 [2025-03-17 05:33:02,852 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 76 treesize of output 60 [2025-03-17 05:33:02,856 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 63 treesize of output 51 [2025-03-17 05:33:02,901 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 05:33:02,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:02,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:02,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912485180] [2025-03-17 05:33:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912485180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:02,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:02,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:33:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631828535] [2025-03-17 05:33:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:02,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:33:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:02,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:33:02,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:33:02,903 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 05:33:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:03,888 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2025-03-17 05:33:03,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:33:03,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 88 [2025-03-17 05:33:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:03,891 INFO L225 Difference]: With dead ends: 429 [2025-03-17 05:33:03,891 INFO L226 Difference]: Without dead ends: 340 [2025-03-17 05:33:03,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:33:03,892 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 497 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:03,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1377 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:33:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-17 05:33:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 332. [2025-03-17 05:33:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 295 states have (on average 1.3796610169491526) internal successors, (407), 297 states have internal predecessors, (407), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:33:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 471 transitions. [2025-03-17 05:33:03,932 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 471 transitions. Word has length 88 [2025-03-17 05:33:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:03,932 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 471 transitions. [2025-03-17 05:33:03,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 05:33:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 471 transitions. [2025-03-17 05:33:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 05:33:03,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:03,945 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] [2025-03-17 05:33:03,957 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 05:33:04,145 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 05:33:04,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:04,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:04,146 INFO L85 PathProgramCache]: Analyzing trace with hash 645746157, now seen corresponding path program 1 times [2025-03-17 05:33:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:04,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591941755] [2025-03-17 05:33:04,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:04,147 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 05:33:04,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:04,150 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 05:33:04,151 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 05:33:04,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 05:33:04,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 05:33:04,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:04,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:04,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 05:33:04,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:04,454 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 05:33:04,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:04,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:04,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591941755] [2025-03-17 05:33:04,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591941755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:04,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:04,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:33:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101805577] [2025-03-17 05:33:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:04,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:33:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:04,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:33:04,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:33:04,456 INFO L87 Difference]: Start difference. First operand 332 states and 471 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 05:33:04,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:04,492 INFO L93 Difference]: Finished difference Result 677 states and 961 transitions. [2025-03-17 05:33:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:33:04,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 89 [2025-03-17 05:33:04,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:04,495 INFO L225 Difference]: With dead ends: 677 [2025-03-17 05:33:04,495 INFO L226 Difference]: Without dead ends: 346 [2025-03-17 05:33:04,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 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 05:33:04,500 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:04,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 237 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-17 05:33:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 332. [2025-03-17 05:33:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 297 states have internal predecessors, (405), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:33:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 469 transitions. [2025-03-17 05:33:04,527 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 469 transitions. Word has length 89 [2025-03-17 05:33:04,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:04,527 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 469 transitions. [2025-03-17 05:33:04,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 05:33:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 469 transitions. [2025-03-17 05:33:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 05:33:04,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:04,531 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] [2025-03-17 05:33:04,541 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 05:33:04,732 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 05:33:04,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:04,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash 123574287, now seen corresponding path program 1 times [2025-03-17 05:33:04,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:04,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016693822] [2025-03-17 05:33:04,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:04,733 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 05:33:04,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:04,735 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 05:33:04,736 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 05:33:04,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 05:33:04,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 05:33:04,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:04,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:05,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:33:05,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:05,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 05:33:05,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 05:33:05,149 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 27 treesize of output 15 [2025-03-17 05:33:05,168 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 05:33:05,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:05,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:05,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016693822] [2025-03-17 05:33:05,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016693822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:05,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474823457] [2025-03-17 05:33:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:05,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:33:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:05,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:33:05,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:05,170 INFO L87 Difference]: Start difference. First operand 332 states and 469 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 05:33:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:05,483 INFO L93 Difference]: Finished difference Result 635 states and 890 transitions. [2025-03-17 05:33:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:33:05,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 89 [2025-03-17 05:33:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:05,486 INFO L225 Difference]: With dead ends: 635 [2025-03-17 05:33:05,486 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 05:33:05,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:05,488 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 353 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:05,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 744 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:33:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 05:33:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 256. [2025-03-17 05:33:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 227 states have (on average 1.3656387665198237) internal successors, (310), 228 states have internal predecessors, (310), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:33:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2025-03-17 05:33:05,505 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 89 [2025-03-17 05:33:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:05,505 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2025-03-17 05:33:05,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 05:33:05,505 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2025-03-17 05:33:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:33:05,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:05,506 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] [2025-03-17 05:33:05,516 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 05:33:05,710 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 05:33:05,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:05,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:05,710 INFO L85 PathProgramCache]: Analyzing trace with hash -251331642, now seen corresponding path program 1 times [2025-03-17 05:33:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140606249] [2025-03-17 05:33:05,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:05,711 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 05:33:05,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:05,713 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 05:33:05,713 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 05:33:05,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:33:06,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:33:06,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:06,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:06,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:33:06,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:06,039 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 05:33:06,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:33:06,224 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 45 treesize of output 33 [2025-03-17 05:33:06,249 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 05:33:06,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:06,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140606249] [2025-03-17 05:33:06,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140606249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:06,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:06,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:33:06,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372126663] [2025-03-17 05:33:06,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:33:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:06,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:33:06,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:33:06,250 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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 05:33:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:06,613 INFO L93 Difference]: Finished difference Result 444 states and 618 transitions. [2025-03-17 05:33:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:33:06,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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 90 [2025-03-17 05:33:06,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:06,616 INFO L225 Difference]: With dead ends: 444 [2025-03-17 05:33:06,617 INFO L226 Difference]: Without dead ends: 306 [2025-03-17 05:33:06,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:33:06,617 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 234 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:06,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 895 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:33:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-17 05:33:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2025-03-17 05:33:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 230 states have (on average 1.3608695652173912) internal successors, (313), 231 states have internal predecessors, (313), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:33:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 363 transitions. [2025-03-17 05:33:06,632 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 363 transitions. Word has length 90 [2025-03-17 05:33:06,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:06,633 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 363 transitions. [2025-03-17 05:33:06,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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 05:33:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2025-03-17 05:33:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:33:06,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:06,633 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] [2025-03-17 05:33:06,645 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 05:33:06,834 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 05:33:06,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:06,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1799590443, now seen corresponding path program 1 times [2025-03-17 05:33:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:06,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164556244] [2025-03-17 05:33:06,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:06,835 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 05:33:06,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:06,838 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 05:33:06,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 (8)] Waiting until timeout for monitored process [2025-03-17 05:33:06,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:33:07,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:33:07,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:07,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:07,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:33:07,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:07,166 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 05:33:07,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 05:33:07,329 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 27 treesize of output 15 [2025-03-17 05:33:07,340 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 05:33:07,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:07,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:07,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164556244] [2025-03-17 05:33:07,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164556244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:07,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:33:07,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:33:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945701123] [2025-03-17 05:33:07,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:07,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:33:07,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:07,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:33:07,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:33:07,341 INFO L87 Difference]: Start difference. First operand 259 states and 363 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 05:33:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:07,694 INFO L93 Difference]: Finished difference Result 458 states and 635 transitions. [2025-03-17 05:33:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:33:07,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 90 [2025-03-17 05:33:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:07,696 INFO L225 Difference]: With dead ends: 458 [2025-03-17 05:33:07,696 INFO L226 Difference]: Without dead ends: 303 [2025-03-17 05:33:07,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:33:07,697 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 312 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:07,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 898 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:33:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-17 05:33:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 255. [2025-03-17 05:33:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 226 states have (on average 1.3539823008849559) internal successors, (306), 227 states have internal predecessors, (306), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:33:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 356 transitions. [2025-03-17 05:33:07,723 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 356 transitions. Word has length 90 [2025-03-17 05:33:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:07,724 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 356 transitions. [2025-03-17 05:33:07,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 05:33:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 356 transitions. [2025-03-17 05:33:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 05:33:07,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:07,725 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] [2025-03-17 05:33:07,736 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 05:33:07,926 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 05:33:07,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:07,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash -341531797, now seen corresponding path program 1 times [2025-03-17 05:33:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:07,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732379436] [2025-03-17 05:33:07,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:07,928 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 05:33:07,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:07,930 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 05:33:07,931 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 05:33:08,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 05:33:08,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 05:33:08,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:08,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:08,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:33:08,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:08,768 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 18 treesize of output 10 [2025-03-17 05:33:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 05:33:08,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:33:08,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:33:08,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-03-17 05:33:09,044 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732379436] [2025-03-17 05:33:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732379436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [969986903] [2025-03-17 05:33:09,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:09,045 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:33:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:33:09,060 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:33:09,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-17 05:33:09,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 05:33:09,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 05:33:09,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:09,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:09,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:33:09,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:10,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:33:10,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 05:33:10,231 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 66 treesize of output 54 [2025-03-17 05:33:10,234 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 69 treesize of output 49 [2025-03-17 05:33:10,285 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 05:33:10,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:10,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [969986903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:10,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:33:10,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2025-03-17 05:33:10,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092156607] [2025-03-17 05:33:10,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:10,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:33:10,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:10,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:33:10,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:33:10,286 INFO L87 Difference]: Start difference. First operand 255 states and 356 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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 05:33:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:11,204 INFO L93 Difference]: Finished difference Result 757 states and 1053 transitions. [2025-03-17 05:33:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:33:11,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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 91 [2025-03-17 05:33:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:11,207 INFO L225 Difference]: With dead ends: 757 [2025-03-17 05:33:11,207 INFO L226 Difference]: Without dead ends: 668 [2025-03-17 05:33:11,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:33:11,208 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 377 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:11,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1309 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:33:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-17 05:33:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 408. [2025-03-17 05:33:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 361 states have (on average 1.3628808864265929) internal successors, (492), 363 states have internal predecessors, (492), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:33:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 574 transitions. [2025-03-17 05:33:11,236 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 574 transitions. Word has length 91 [2025-03-17 05:33:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:11,237 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 574 transitions. [2025-03-17 05:33:11,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 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 05:33:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 574 transitions. [2025-03-17 05:33:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 05:33:11,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:11,238 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] [2025-03-17 05:33:11,250 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 05:33:11,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2025-03-17 05:33:11,638 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:33:11,639 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:11,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash -408538550, now seen corresponding path program 1 times [2025-03-17 05:33:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:11,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385696590] [2025-03-17 05:33:11,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:11,639 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 05:33:11,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:11,641 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 05:33:11,642 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 05:33:11,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 05:33:11,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 05:33:11,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:11,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:11,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:33:11,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:11,948 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 9 treesize of output 3 [2025-03-17 05:33:12,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 15 treesize of output 7 [2025-03-17 05:33:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 05:33:12,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:33:12,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:33:12,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2025-03-17 05:33:13,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385696590] [2025-03-17 05:33:13,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385696590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:13,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1273818667] [2025-03-17 05:33:13,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:13,105 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:33:13,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:33:13,107 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:33:13,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-17 05:33:13,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 05:33:14,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 05:33:14,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:14,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:14,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:33:14,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:14,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:33:15,389 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-03-17 05:33:15,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2025-03-17 05:33:15,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 05:33:15,990 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 66 treesize of output 54 [2025-03-17 05:33:15,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:33:16,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 107 [2025-03-17 05:33:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 05:33:16,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:33:16,306 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 05:33:16,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1273818667] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:16,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:33:16,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 17] total 29 [2025-03-17 05:33:16,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568304239] [2025-03-17 05:33:16,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:16,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:16,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:16,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:16,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 05:33:16,307 INFO L87 Difference]: Start difference. First operand 408 states and 574 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 05:33:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:16,546 INFO L93 Difference]: Finished difference Result 640 states and 899 transitions. [2025-03-17 05:33:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:16,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 91 [2025-03-17 05:33:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:16,548 INFO L225 Difference]: With dead ends: 640 [2025-03-17 05:33:16,548 INFO L226 Difference]: Without dead ends: 551 [2025-03-17 05:33:16,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 05:33:16,549 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 98 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:16,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 601 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:33:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-17 05:33:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 408. [2025-03-17 05:33:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 361 states have (on average 1.3628808864265929) internal successors, (492), 363 states have internal predecessors, (492), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:33:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 574 transitions. [2025-03-17 05:33:16,567 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 574 transitions. Word has length 91 [2025-03-17 05:33:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:16,567 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 574 transitions. [2025-03-17 05:33:16,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 05:33:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 574 transitions. [2025-03-17 05:33:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:33:16,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:16,568 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 05:33:16,578 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 05:33:16,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-17 05:33:16,968 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:33:16,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:16,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2052809004, now seen corresponding path program 1 times [2025-03-17 05:33:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:16,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273183055] [2025-03-17 05:33:16,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:16,970 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 05:33:16,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:16,973 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 05:33:16,974 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 05:33:17,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:33:17,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:33:17,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:17,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:17,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:33:17,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:17,728 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 18 treesize of output 10 [2025-03-17 05:33:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 05:33:17,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:33:17,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:33:17,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-03-17 05:33:17,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:17,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273183055] [2025-03-17 05:33:17,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273183055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:17,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1885450679] [2025-03-17 05:33:17,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:17,979 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:33:17,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:33:17,981 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:33:17,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-03-17 05:33:18,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:33:18,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:33:18,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:18,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:18,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:33:18,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:18,446 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 05:33:18,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:18,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1885450679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:18,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:33:18,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-03-17 05:33:18,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022931831] [2025-03-17 05:33:18,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:18,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:33:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:18,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:33:18,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:33:18,448 INFO L87 Difference]: Start difference. First operand 408 states and 574 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 05:33:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:18,521 INFO L93 Difference]: Finished difference Result 663 states and 929 transitions. [2025-03-17 05:33:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:33:18,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 05:33:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:18,523 INFO L225 Difference]: With dead ends: 663 [2025-03-17 05:33:18,523 INFO L226 Difference]: Without dead ends: 485 [2025-03-17 05:33:18,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:33:18,524 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 61 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:18,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 551 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-17 05:33:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 399. [2025-03-17 05:33:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 352 states have (on average 1.3551136363636365) internal successors, (477), 354 states have internal predecessors, (477), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:33:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 559 transitions. [2025-03-17 05:33:18,545 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 559 transitions. Word has length 92 [2025-03-17 05:33:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:18,545 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 559 transitions. [2025-03-17 05:33:18,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 05:33:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 559 transitions. [2025-03-17 05:33:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:33:18,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:18,547 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 05:33:18,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2025-03-17 05:33:18,762 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 05:33:18,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 05:33:18,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2030807379, now seen corresponding path program 1 times [2025-03-17 05:33:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:18,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065092667] [2025-03-17 05:33:18,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:18,953 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 05:33:18,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:18,955 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 05:33:18,957 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 05:33:19,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:33:19,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:33:19,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:19,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:19,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:33:19,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:19,661 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 18 treesize of output 10 [2025-03-17 05:33:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 05:33:19,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:33:19,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:33:19,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-03-17 05:33:19,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:19,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065092667] [2025-03-17 05:33:19,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065092667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:19,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [191461185] [2025-03-17 05:33:19,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:19,929 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:33:19,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:33:19,931 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:33:19,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-03-17 05:33:20,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:33:20,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:33:20,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:20,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:20,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:33:20,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:20,297 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 05:33:20,327 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 05:33:20,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:33:20,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [191461185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:33:20,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:33:20,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2025-03-17 05:33:20,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352642857] [2025-03-17 05:33:20,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:33:20,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:33:20,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:20,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:33:20,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:33:20,329 INFO L87 Difference]: Start difference. First operand 399 states and 559 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 05:33:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:20,357 INFO L93 Difference]: Finished difference Result 518 states and 719 transitions. [2025-03-17 05:33:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:33:20,358 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 05:33:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:20,359 INFO L225 Difference]: With dead ends: 518 [2025-03-17 05:33:20,359 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 05:33:20,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:33:20,360 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 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 05:33:20,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:33:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 05:33:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2025-03-17 05:33:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:33:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 212 transitions. [2025-03-17 05:33:20,369 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 212 transitions. Word has length 92 [2025-03-17 05:33:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:20,369 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 212 transitions. [2025-03-17 05:33:20,369 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 05:33:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 212 transitions. [2025-03-17 05:33:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:33:20,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:20,370 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 05:33:20,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2025-03-17 05:33:20,583 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 05:33:20,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 05:33:20,774 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:20,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1999444252, now seen corresponding path program 1 times [2025-03-17 05:33:20,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:20,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348290967] [2025-03-17 05:33:20,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:20,775 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 05:33:20,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:20,776 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 05:33:20,778 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 05:33:20,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:33:21,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:33:21,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:21,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:21,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:33:21,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:21,165 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 9 treesize of output 3 [2025-03-17 05:33:21,499 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 15 treesize of output 7 [2025-03-17 05:33:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 05:33:21,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:33:21,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:33:21,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2025-03-17 05:33:22,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:22,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348290967] [2025-03-17 05:33:22,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348290967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [469878133] [2025-03-17 05:33:22,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:22,040 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:33:22,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:33:22,062 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:33:22,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-03-17 05:33:22,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:33:23,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:33:23,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:23,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:23,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:33:23,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:23,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:33:24,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 05:33:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 05:33:24,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:33:24,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [469878133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:24,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:33:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-17 05:33:24,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504023207] [2025-03-17 05:33:24,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:33:24,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:33:24,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:24,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:33:24,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:33:24,755 INFO L87 Difference]: Start difference. First operand 156 states and 212 transitions. Second operand has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 05:33:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:25,558 INFO L93 Difference]: Finished difference Result 321 states and 429 transitions. [2025-03-17 05:33:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:33:25,559 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 92 [2025-03-17 05:33:25,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:25,560 INFO L225 Difference]: With dead ends: 321 [2025-03-17 05:33:25,560 INFO L226 Difference]: Without dead ends: 216 [2025-03-17 05:33:25,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 05:33:25,561 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 209 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:25,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1132 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:33:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-17 05:33:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 172. [2025-03-17 05:33:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 149 states have internal predecessors, (193), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:33:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2025-03-17 05:33:25,570 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 92 [2025-03-17 05:33:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:25,570 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2025-03-17 05:33:25,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 05:33:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2025-03-17 05:33:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:33:25,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:25,574 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 05:33:25,587 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 (17)] Ended with exit code 0 [2025-03-17 05:33:25,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2025-03-17 05:33:25,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:33:25,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:25,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash 257466755, now seen corresponding path program 1 times [2025-03-17 05:33:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8236981] [2025-03-17 05:33:25,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:25,976 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 05:33:25,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:25,978 INFO L229 MonitoredProcess]: Starting monitored process 19 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 05:33:25,979 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 (19)] Waiting until timeout for monitored process [2025-03-17 05:33:26,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:33:26,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:33:26,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:26,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:26,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:33:26,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:26,400 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 9 treesize of output 3 [2025-03-17 05:33:26,748 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 15 treesize of output 7 [2025-03-17 05:33:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 05:33:26,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:33:26,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:33:26,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8236981] [2025-03-17 05:33:26,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8236981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:26,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1123491108] [2025-03-17 05:33:26,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:26,861 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:33:26,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:33:26,863 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:33:26,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-03-17 05:33:26,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:33:28,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:33:28,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:33:28,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:33:28,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:33:28,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:33:28,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:33:29,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 05:33:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 05:33:29,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:33:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1123491108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:33:29,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:33:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-17 05:33:29,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080668113] [2025-03-17 05:33:29,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:33:29,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:33:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:33:29,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:33:29,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:33:29,239 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 05:33:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:33:30,050 INFO L93 Difference]: Finished difference Result 321 states and 427 transitions. [2025-03-17 05:33:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:33:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 92 [2025-03-17 05:33:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:33:30,054 INFO L225 Difference]: With dead ends: 321 [2025-03-17 05:33:30,054 INFO L226 Difference]: Without dead ends: 216 [2025-03-17 05:33:30,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:33:30,054 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 264 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:33:30,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1061 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:33:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-17 05:33:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 170. [2025-03-17 05:33:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 147 states have internal predecessors, (190), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:33:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 226 transitions. [2025-03-17 05:33:30,065 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 226 transitions. Word has length 92 [2025-03-17 05:33:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:33:30,065 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 226 transitions. [2025-03-17 05:33:30,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 05:33:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 226 transitions. [2025-03-17 05:33:30,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:33:30,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:33:30,066 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] [2025-03-17 05:33:30,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2025-03-17 05:33:30,278 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 (19)] Ended with exit code 0 [2025-03-17 05:33:30,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /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 05:33:30,467 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:33:30,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:33:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash -570568826, now seen corresponding path program 1 times [2025-03-17 05:33:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:33:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99143779] [2025-03-17 05:33:30,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:33:30,468 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 05:33:30,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:33:30,471 INFO L229 MonitoredProcess]: Starting monitored process 21 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 05:33:30,472 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 (21)] Waiting until timeout for monitored process [2025-03-17 05:33:30,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.