./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-p_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:34:38,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:34:38,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:34:38,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:34:38,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:34:38,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:34:38,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:34:38,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:34:38,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:34:38,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:34:38,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:34:38,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:34:38,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:34:38,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:34:38,333 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:34:38,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:34:38,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:34:38,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:34:38,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:34:38,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:34:38,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:34:38,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:34:38,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:34:38,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:34:38,338 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:34:38,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:34:38,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:34:38,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:34:38,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:34:38,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:34:38,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:34:38,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:34:38,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:34:38,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:34:38,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:34:38,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:34:38,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:34:38,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:34:38,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:34:38,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:34:38,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:34:38,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:34:38,341 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 [2024-11-10 09:34:38,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:34:38,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:34:38,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:34:38,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:34:38,585 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:34:38,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2024-11-10 09:34:40,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:34:40,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:34:40,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2024-11-10 09:34:40,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db65adba1/a683feb7139948bb9e346a49a0d32940/FLAG1bb39407a [2024-11-10 09:34:40,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db65adba1/a683feb7139948bb9e346a49a0d32940 [2024-11-10 09:34:40,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:34:40,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:34:40,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:34:40,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:34:40,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:34:40,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:40,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df433d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40, skipping insertion in model container [2024-11-10 09:34:40,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:40,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:34:40,783 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-p_file-26.i[916,929] [2024-11-10 09:34:40,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:34:40,834 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:34:40,843 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-p_file-26.i[916,929] [2024-11-10 09:34:40,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:34:40,895 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:34:40,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40 WrapperNode [2024-11-10 09:34:40,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:34:40,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:34:40,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:34:40,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:34:40,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:40,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:40,985 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-10 09:34:40,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:34:41,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:34:41,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:34:41,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:34:41,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,041 INFO L175 MemorySlicer]: Split 129 memory accesses to 11 slices as follows [2, 13, 6, 3, 10, 8, 64, 6, 3, 7, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 11 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-11-10 09:34:41,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:34:41,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:34:41,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:34:41,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:34:41,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (1/1) ... [2024-11-10 09:34:41,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:34:41,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:34:41,132 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) [2024-11-10 09:34:41,146 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 [2024-11-10 09:34:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:34:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:34:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:34:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:34:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:34:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:34:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:34:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 09:34:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-10 09:34:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-10 09:34:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-10 09:34:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-10 09:34:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:34:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:34:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:34:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:34:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:34:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:34:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-10 09:34:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-10 09:34:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-10 09:34:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-10 09:34:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-10 09:34:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:34:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:34:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:34:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:34:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:34:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:34:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-10 09:34:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-10 09:34:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-10 09:34:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-10 09:34:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-10 09:34:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:34:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:34:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:34:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:34:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:34:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:34:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 09:34:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-10 09:34:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-10 09:34:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-10 09:34:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-10 09:34:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:34:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:34:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:34:41,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:34:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:34:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:34:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:34:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:34:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 09:34:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-10 09:34:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-10 09:34:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-10 09:34:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-10 09:34:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:34:41,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:34:41,334 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:34:41,337 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:34:41,740 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2024-11-10 09:34:41,796 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-10 09:34:41,796 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:34:41,813 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:34:41,813 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:34:41,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:34:41 BoogieIcfgContainer [2024-11-10 09:34:41,815 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:34:41,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:34:41,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:34:41,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:34:41,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:34:40" (1/3) ... [2024-11-10 09:34:41,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743707a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:34:41, skipping insertion in model container [2024-11-10 09:34:41,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:40" (2/3) ... [2024-11-10 09:34:41,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743707a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:34:41, skipping insertion in model container [2024-11-10 09:34:41,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:34:41" (3/3) ... [2024-11-10 09:34:41,823 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-26.i [2024-11-10 09:34:41,835 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:34:41,835 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:34:41,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:34:41,901 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;@7951ff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:34:41,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:34:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 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) [2024-11-10 09:34:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:34:41,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:41,915 INFO L215 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] [2024-11-10 09:34:41,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:41,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2133626379, now seen corresponding path program 1 times [2024-11-10 09:34:41,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:41,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317309379] [2024-11-10 09:34:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:34:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:34:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:34:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:34:42,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:42,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317309379] [2024-11-10 09:34:42,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317309379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:42,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:42,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:34:42,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749422456] [2024-11-10 09:34:42,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:42,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:34:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:42,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:34:42,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:34:42,353 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:34:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:42,405 INFO L93 Difference]: Finished difference Result 184 states and 276 transitions. [2024-11-10 09:34:42,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:34:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 1 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 91 [2024-11-10 09:34:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:42,427 INFO L225 Difference]: With dead ends: 184 [2024-11-10 09:34:42,427 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 09:34:42,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:34:42,471 INFO L432 NwaCegarLoop]: 129 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, 129 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 [2024-11-10 09:34:42,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 09:34:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 09:34:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 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) [2024-11-10 09:34:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-11-10 09:34:42,551 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 91 [2024-11-10 09:34:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:42,553 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-11-10 09:34:42,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:34:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-10 09:34:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:34:42,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:42,559 INFO L215 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] [2024-11-10 09:34:42,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:34:42,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:42,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash -199731598, now seen corresponding path program 1 times [2024-11-10 09:34:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:42,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269881812] [2024-11-10 09:34:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:34:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:34:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:34:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:34:42,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269881812] [2024-11-10 09:34:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269881812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:42,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:42,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:34:42,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086115016] [2024-11-10 09:34:42,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:42,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:34:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:34:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:34:42,910 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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) [2024-11-10 09:34:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:42,951 INFO L93 Difference]: Finished difference Result 182 states and 259 transitions. [2024-11-10 09:34:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:34:42,954 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), 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 [2024-11-10 09:34:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:42,955 INFO L225 Difference]: With dead ends: 182 [2024-11-10 09:34:42,955 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 09:34:42,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:34:42,957 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:42,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 369 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 09:34:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-10 09:34:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 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) [2024-11-10 09:34:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-11-10 09:34:42,973 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 91 [2024-11-10 09:34:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:42,974 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-11-10 09:34:42,974 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), 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) [2024-11-10 09:34:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-11-10 09:34:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:34:42,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:42,976 INFO L215 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] [2024-11-10 09:34:42,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:34:42,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:42,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash -171102447, now seen corresponding path program 1 times [2024-11-10 09:34:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900524045] [2024-11-10 09:34:42,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:34:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:34:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:34:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:34:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:43,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900524045] [2024-11-10 09:34:43,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900524045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:43,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:34:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721473407] [2024-11-10 09:34:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:43,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:34:43,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:43,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:34:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:34:43,210 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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) [2024-11-10 09:34:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:43,226 INFO L93 Difference]: Finished difference Result 183 states and 259 transitions. [2024-11-10 09:34:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:34:43,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 [2024-11-10 09:34:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:43,230 INFO L225 Difference]: With dead ends: 183 [2024-11-10 09:34:43,230 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 09:34:43,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:34:43,234 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:43,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 09:34:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 09:34:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 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) [2024-11-10 09:34:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-10 09:34:43,246 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 91 [2024-11-10 09:34:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:43,249 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-10 09:34:43,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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) [2024-11-10 09:34:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-10 09:34:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:34:43,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:43,251 INFO L215 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] [2024-11-10 09:34:43,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:34:43,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:43,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash 40248466, now seen corresponding path program 1 times [2024-11-10 09:34:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:43,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003574439] [2024-11-10 09:34:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:34:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:34:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:34:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:34:43,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:43,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003574439] [2024-11-10 09:34:43,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003574439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:43,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:43,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:34:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927642388] [2024-11-10 09:34:43,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:43,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:34:43,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:43,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:34:43,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:34:43,773 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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) [2024-11-10 09:34:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:43,917 INFO L93 Difference]: Finished difference Result 183 states and 257 transitions. [2024-11-10 09:34:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:34:43,918 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), 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 [2024-11-10 09:34:43,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:43,922 INFO L225 Difference]: With dead ends: 183 [2024-11-10 09:34:43,922 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 09:34:43,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:34:43,924 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:43,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:34:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 09:34:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 09:34:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 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) [2024-11-10 09:34:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2024-11-10 09:34:43,939 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 91 [2024-11-10 09:34:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:43,940 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2024-11-10 09:34:43,940 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), 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) [2024-11-10 09:34:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-11-10 09:34:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:34:43,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:43,945 INFO L215 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] [2024-11-10 09:34:43,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:34:43,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:43,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1547800275, now seen corresponding path program 1 times [2024-11-10 09:34:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984269469] [2024-11-10 09:34:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:34:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [27139491] [2024-11-10 09:34:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:44,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:34:44,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:34:44,106 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) [2024-11-10 09:34:44,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:34:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:34:44,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:34:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:34:44,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:34:44,717 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:34:44,718 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:34:44,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:34:44,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:34:44,923 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 09:34:45,094 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:34:45,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:34:45 BoogieIcfgContainer [2024-11-10 09:34:45,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:34:45,097 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:34:45,097 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:34:45,097 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:34:45,098 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:34:41" (3/4) ... [2024-11-10 09:34:45,099 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:34:45,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:34:45,102 INFO L158 Benchmark]: Toolchain (without parser) took 4469.32ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 70.8MB in the beginning and 124.4MB in the end (delta: -53.5MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. [2024-11-10 09:34:45,102 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:34:45,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.91ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 54.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:34:45,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.04ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 54.3MB in the beginning and 171.5MB in the end (delta: -117.2MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-10 09:34:45,104 INFO L158 Benchmark]: Boogie Preprocessor took 83.22ms. Allocated memory is still 203.4MB. Free memory was 171.1MB in the beginning and 167.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:34:45,105 INFO L158 Benchmark]: IcfgBuilder took 725.19ms. Allocated memory is still 203.4MB. Free memory was 167.1MB in the beginning and 124.1MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-10 09:34:45,105 INFO L158 Benchmark]: TraceAbstraction took 3280.17ms. Allocated memory was 203.4MB in the beginning and 272.6MB in the end (delta: 69.2MB). Free memory was 124.1MB in the beginning and 124.4MB in the end (delta: -260.1kB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2024-11-10 09:34:45,105 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 272.6MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:34:45,106 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.91ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 54.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.04ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 54.3MB in the beginning and 171.5MB in the end (delta: -117.2MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.22ms. Allocated memory is still 203.4MB. Free memory was 171.1MB in the beginning and 167.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 725.19ms. Allocated memory is still 203.4MB. Free memory was 167.1MB in the beginning and 124.1MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3280.17ms. Allocated memory was 203.4MB in the beginning and 272.6MB in the end (delta: 69.2MB). Free memory was 124.1MB in the beginning and 124.4MB in the end (delta: -260.1kB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 272.6MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L22] signed short int var_1_1 = -1; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_4 = 1; [L24] signed short int var_1_4 = 1; [L25] signed short int* var_1_4_Pointer = &(var_1_4); [L26] float var_1_12 = 1.125; [L26] float var_1_12 = 1.125; [L27] float* var_1_12_Pointer = &(var_1_12); [L28] float var_1_13 = 199.5; [L28] float var_1_13 = 199.5; [L29] float* var_1_13_Pointer = &(var_1_13); [L30] float var_1_14 = 100000000000000.3; [L30] float var_1_14 = 100000000000000.3; [L31] float* var_1_14_Pointer = &(var_1_14); [L32] unsigned char var_1_15 = 64; [L32] unsigned char var_1_15 = 64; [L33] unsigned char* var_1_15_Pointer = &(var_1_15); [L34] unsigned char var_1_16 = 2; [L34] unsigned char var_1_16 = 2; [L35] unsigned char* var_1_16_Pointer = &(var_1_16); [L36] unsigned long int var_1_17 = 50; [L36] unsigned long int var_1_17 = 50; [L37] unsigned long int* var_1_17_Pointer = &(var_1_17); [L38] signed long int var_1_19 = -32; [L38] signed long int var_1_19 = -32; [L39] signed long int* var_1_19_Pointer = &(var_1_19); [L40] float var_1_20 = 8.75; [L40] float var_1_20 = 8.75; [L41] float* var_1_20_Pointer = &(var_1_20); [L42] unsigned char last_1_var_1_15 = 64; VAL [isInitial=0, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L78] EXPR \read(var_1_15) [L78] last_1_var_1_15 = var_1_15 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_short() [L63] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L63] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L63] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L64] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L64] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L64] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L65] var_1_13 = __VERIFIER_nondet_float() [L66] EXPR \read(var_1_13) [L66] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L66] EXPR \read(var_1_13) [L66] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L67] var_1_14 = __VERIFIER_nondet_float() [L68] EXPR \read(var_1_14) [L68] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F [L68] EXPR \read(var_1_14) [L68] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L69] var_1_16 = __VERIFIER_nondet_uchar() [L70] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L70] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L70] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L71] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L71] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L71] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L72] var_1_19 = __VERIFIER_nondet_long() [L73] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L73] CALL assume_abort_if_not(var_1_19 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L73] RET assume_abort_if_not(var_1_19 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L74] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L74] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L74] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L75] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L75] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L75] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L89] RET updateVariables() [L90] CALL step() [L46] EXPR \read(*var_1_13_Pointer) [L46] EXPR \read(*var_1_14_Pointer) [L46] (*(var_1_12_Pointer)) = ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) [L47] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L47] COND TRUE (- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4)))) [L48] EXPR \read(*var_1_16_Pointer) [L48] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L50] EXPR \read(*var_1_13_Pointer) [L50] (*(var_1_20_Pointer)) = (*(var_1_13_Pointer)) [L51] EXPR \read(*var_1_20_Pointer) [L51] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L51] COND TRUE (*(var_1_20_Pointer)) > (*(var_1_20_Pointer)) [L52] EXPR \read(*var_1_15_Pointer) [L52] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L52] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L52] EXPR \read(*var_1_15_Pointer) [L52] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L52] (*(var_1_1_Pointer)) = (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) [L56] EXPR \read(*var_1_15_Pointer) [L56] EXPR \read(*var_1_15_Pointer) [L56] EXPR \read(*var_1_1_Pointer) [L56] signed long int stepLocal_0 = (*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer))); [L57] EXPR \read(*var_1_15_Pointer) [L57] EXPR \read(*var_1_1_Pointer) [L57] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L57] COND FALSE !(stepLocal_0 != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR \read(*var_1_20_Pointer) [L81] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))))))) [L81] EXPR \read(*var_1_1_Pointer) [L81] EXPR \read(*var_1_15_Pointer) [L81] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L81] EXPR \read(*var_1_15_Pointer) [L81] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))))) [L81] EXPR \read(*var_1_12_Pointer) [L81] EXPR \read(*var_1_13_Pointer) [L81] EXPR \read(*var_1_14_Pointer) [L81] EXPR (((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81-L82] return ((((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_13_Pointer)))) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1041 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 534 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 507 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:34:45,137 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/11.0.12-open/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.5.800.v20200727-1323.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-p_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:34:47,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:34:47,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:34:47,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:34:47,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:34:47,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:34:47,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:34:47,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:34:47,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:34:47,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:34:47,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:34:47,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:34:47,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:34:47,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:34:47,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:34:47,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:34:47,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:34:47,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:34:47,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:34:47,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:34:47,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:34:47,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:34:47,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:34:47,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:34:47,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:34:47,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:34:47,331 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:34:47,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:34:47,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:34:47,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:34:47,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:34:47,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:34:47,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:34:47,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:34:47,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:34:47,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:34:47,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:34:47,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:34:47,335 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:34:47,336 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:34:47,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:34:47,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:34:47,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:34:47,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:34:47,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 [2024-11-10 09:34:47,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:34:47,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:34:47,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:34:47,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:34:47,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:34:47,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2024-11-10 09:34:49,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:34:49,379 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:34:49,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2024-11-10 09:34:49,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df596300/36e4af913cfd41f7abd4827abb304a29/FLAG62b6954a9 [2024-11-10 09:34:49,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df596300/36e4af913cfd41f7abd4827abb304a29 [2024-11-10 09:34:49,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:34:49,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:34:49,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:34:49,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:34:49,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:34:49,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f84207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49, skipping insertion in model container [2024-11-10 09:34:49,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:34:49,592 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-p_file-26.i[916,929] [2024-11-10 09:34:49,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:34:49,668 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:34:49,677 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-p_file-26.i[916,929] [2024-11-10 09:34:49,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:34:49,715 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:34:49,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49 WrapperNode [2024-11-10 09:34:49,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:34:49,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:34:49,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:34:49,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:34:49,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,769 INFO L138 Inliner]: procedures = 36, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2024-11-10 09:34:49,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:34:49,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:34:49,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:34:49,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:34:49,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,809 INFO L175 MemorySlicer]: Split 129 memory accesses to 11 slices as follows [2, 13, 6, 3, 10, 8, 64, 6, 3, 7, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 11 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-11-10 09:34:49,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:34:49,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:34:49,844 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:34:49,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:34:49,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (1/1) ... [2024-11-10 09:34:49,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:34:49,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:34:49,873 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) [2024-11-10 09:34:49,876 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 [2024-11-10 09:34:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:34:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:34:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:34:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:34:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:34:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:34:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:34:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-10 09:34:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-10 09:34:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-10 09:34:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-10 09:34:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-10 09:34:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:34:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:34:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:34:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:34:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:34:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 09:34:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-10 09:34:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-10 09:34:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-10 09:34:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-10 09:34:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-10 09:34:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:34:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:34:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:34:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:34:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:34:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 09:34:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-10 09:34:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-10 09:34:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-10 09:34:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-10 09:34:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-10 09:34:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:34:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:34:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-10 09:34:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-10 09:34:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-10 09:34:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-10 09:34:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-10 09:34:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-10 09:34:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-10 09:34:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-10 09:34:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-10 09:34:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:34:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:34:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:34:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:34:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:34:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-10 09:34:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-10 09:34:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-10 09:34:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-10 09:34:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-10 09:34:49,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-10 09:34:49,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:34:49,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:34:49,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:34:49,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:34:49,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:34:49,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-10 09:34:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-10 09:34:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-10 09:34:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-10 09:34:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-10 09:34:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-10 09:34:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:34:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:34:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-10 09:34:49,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-10 09:34:49,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-10 09:34:49,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-10 09:34:49,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-10 09:34:49,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-10 09:34:49,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-10 09:34:49,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-10 09:34:49,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-10 09:34:49,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:34:49,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:34:49,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-10 09:34:49,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-10 09:34:49,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-10 09:34:49,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-10 09:34:49,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-10 09:34:49,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-10 09:34:49,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-10 09:34:49,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-10 09:34:49,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-10 09:34:49,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:34:49,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:34:49,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:34:49,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:34:49,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:34:49,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:34:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:34:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:34:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:34:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:34:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-10 09:34:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-10 09:34:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-10 09:34:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-10 09:34:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-10 09:34:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:34:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:34:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:34:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:34:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:34:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:34:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:34:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-10 09:34:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-10 09:34:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-10 09:34:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-10 09:34:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-10 09:34:49,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-10 09:34:50,154 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:34:50,156 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:34:51,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2024-11-10 09:34:51,041 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-10 09:34:51,041 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:34:51,053 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:34:51,054 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:34:51,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:34:51 BoogieIcfgContainer [2024-11-10 09:34:51,054 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:34:51,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:34:51,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:34:51,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:34:51,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:34:49" (1/3) ... [2024-11-10 09:34:51,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32820baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:34:51, skipping insertion in model container [2024-11-10 09:34:51,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:49" (2/3) ... [2024-11-10 09:34:51,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32820baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:34:51, skipping insertion in model container [2024-11-10 09:34:51,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:34:51" (3/3) ... [2024-11-10 09:34:51,062 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-26.i [2024-11-10 09:34:51,077 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:34:51,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:34:51,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:34:51,138 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;@3f428fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:34:51,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:34:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 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) [2024-11-10 09:34:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:34:51,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:51,149 INFO L215 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] [2024-11-10 09:34:51,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:51,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2133626379, now seen corresponding path program 1 times [2024-11-10 09:34:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:51,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230559792] [2024-11-10 09:34:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:51,165 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 [2024-11-10 09:34:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:51,186 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) [2024-11-10 09:34:51,187 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 [2024-11-10 09:34:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:51,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:34:51,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-10 09:34:51,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:34:51,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:51,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230559792] [2024-11-10 09:34:51,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230559792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:51,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:51,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:34:51,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781704179] [2024-11-10 09:34:51,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:51,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:34:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:51,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:34:51,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:34:51,689 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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) [2024-11-10 09:34:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:51,715 INFO L93 Difference]: Finished difference Result 184 states and 276 transitions. [2024-11-10 09:34:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:34:51,716 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 91 [2024-11-10 09:34:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:51,722 INFO L225 Difference]: With dead ends: 184 [2024-11-10 09:34:51,722 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 09:34:51,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:34:51,728 INFO L432 NwaCegarLoop]: 129 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, 129 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 [2024-11-10 09:34:51,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 09:34:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 09:34:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 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) [2024-11-10 09:34:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-11-10 09:34:51,763 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 91 [2024-11-10 09:34:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:51,764 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-11-10 09:34:51,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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) [2024-11-10 09:34:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-10 09:34:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:34:51,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:51,768 INFO L215 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] [2024-11-10 09:34:51,779 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 [2024-11-10 09:34:51,972 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 [2024-11-10 09:34:51,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:51,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash -199731598, now seen corresponding path program 1 times [2024-11-10 09:34:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311210727] [2024-11-10 09:34:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:51,979 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 [2024-11-10 09:34:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:51,980 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) [2024-11-10 09:34:51,982 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 [2024-11-10 09:34:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:52,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:34:52,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:34:52,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:34:52,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:52,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311210727] [2024-11-10 09:34:52,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311210727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:52,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:52,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:34:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358584424] [2024-11-10 09:34:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:52,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:34:52,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:52,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:34:52,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:34:52,402 INFO L87 Difference]: Start difference. First operand 91 states and 129 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) [2024-11-10 09:34:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:52,447 INFO L93 Difference]: Finished difference Result 184 states and 262 transitions. [2024-11-10 09:34:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:34:52,447 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 [2024-11-10 09:34:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:52,448 INFO L225 Difference]: With dead ends: 184 [2024-11-10 09:34:52,448 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:34:52,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:34:52,450 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:52,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 483 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:34:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-10 09:34:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 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) [2024-11-10 09:34:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2024-11-10 09:34:52,460 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 91 [2024-11-10 09:34:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:52,463 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2024-11-10 09:34:52,463 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) [2024-11-10 09:34:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2024-11-10 09:34:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:34:52,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:52,465 INFO L215 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] [2024-11-10 09:34:52,478 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 [2024-11-10 09:34:52,665 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 [2024-11-10 09:34:52,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:52,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash -171102447, now seen corresponding path program 1 times [2024-11-10 09:34:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:52,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951292842] [2024-11-10 09:34:52,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:52,669 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 [2024-11-10 09:34:52,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:52,672 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) [2024-11-10 09:34:52,673 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 [2024-11-10 09:34:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:52,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:34:52,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:53,074 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 77 treesize of output 41 [2024-11-10 09:34:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-10 09:34:53,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:34:53,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:53,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951292842] [2024-11-10 09:34:53,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951292842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:53,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:53,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:34:53,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921496841] [2024-11-10 09:34:53,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:53,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:34:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:53,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:34:53,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:34:53,187 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-11-10 09:34:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:53,781 INFO L93 Difference]: Finished difference Result 188 states and 264 transitions. [2024-11-10 09:34:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:34:53,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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 91 [2024-11-10 09:34:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:53,783 INFO L225 Difference]: With dead ends: 188 [2024-11-10 09:34:53,783 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:34:53,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:34:53,784 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 114 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:53,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 441 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:34:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:34:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-10 09:34:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 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) [2024-11-10 09:34:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-10 09:34:53,795 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 91 [2024-11-10 09:34:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:53,795 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-10 09:34:53,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-11-10 09:34:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-10 09:34:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 09:34:53,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:53,797 INFO L215 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] [2024-11-10 09:34:53,808 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 [2024-11-10 09:34:54,000 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 [2024-11-10 09:34:54,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:54,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1176447793, now seen corresponding path program 1 times [2024-11-10 09:34:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:54,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815909976] [2024-11-10 09:34:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:54,002 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 [2024-11-10 09:34:54,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:54,008 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) [2024-11-10 09:34:54,009 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 [2024-11-10 09:34:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:54,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 09:34:54,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:55,067 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 74 treesize of output 38 [2024-11-10 09:34:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-10 09:34:55,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:34:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:34:55,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:55,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815909976] [2024-11-10 09:34:55,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815909976] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:34:55,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:34:55,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2024-11-10 09:34:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839220158] [2024-11-10 09:34:55,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:55,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:34:55,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:55,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:34:55,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:34:55,215 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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) [2024-11-10 09:34:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:55,412 INFO L93 Difference]: Finished difference Result 185 states and 258 transitions. [2024-11-10 09:34:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:34:55,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 [2024-11-10 09:34:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:55,414 INFO L225 Difference]: With dead ends: 185 [2024-11-10 09:34:55,414 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 09:34:55,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:34:55,415 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:55,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:34:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 09:34:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 09:34:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:34:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2024-11-10 09:34:55,420 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 93 [2024-11-10 09:34:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:55,421 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2024-11-10 09:34:55,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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) [2024-11-10 09:34:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2024-11-10 09:34:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 09:34:55,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:55,422 INFO L215 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, 1] [2024-11-10 09:34:55,436 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 [2024-11-10 09:34:55,626 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 [2024-11-10 09:34:55,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:55,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1490403073, now seen corresponding path program 1 times [2024-11-10 09:34:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:55,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315255800] [2024-11-10 09:34:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:55,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:34:55,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:55,634 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) [2024-11-10 09:34:55,635 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 [2024-11-10 09:34:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:56,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 09:34:56,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:56,723 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 [2024-11-10 09:34:56,726 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 86 treesize of output 50 [2024-11-10 09:34:56,899 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 70 treesize of output 34 [2024-11-10 09:34:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-10 09:34:56,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:34:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:34:57,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315255800] [2024-11-10 09:34:57,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315255800] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:34:57,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:34:57,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2024-11-10 09:34:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612197128] [2024-11-10 09:34:57,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:57,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:34:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:57,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:34:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:34:57,087 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2024-11-10 09:34:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:57,109 INFO L93 Difference]: Finished difference Result 181 states and 250 transitions. [2024-11-10 09:34:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:34:57,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 98 [2024-11-10 09:34:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:57,111 INFO L225 Difference]: With dead ends: 181 [2024-11-10 09:34:57,111 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 09:34:57,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:34:57,112 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 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 [2024-11-10 09:34:57,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 09:34:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 09:34:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:34:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2024-11-10 09:34:57,118 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 98 [2024-11-10 09:34:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:57,118 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2024-11-10 09:34:57,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2024-11-10 09:34:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2024-11-10 09:34:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 09:34:57,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:57,120 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:57,140 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 [2024-11-10 09:34:57,321 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 [2024-11-10 09:34:57,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:57,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -630332058, now seen corresponding path program 1 times [2024-11-10 09:34:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:57,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456280511] [2024-11-10 09:34:57,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:57,323 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 [2024-11-10 09:34:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:57,326 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) [2024-11-10 09:34:57,327 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 [2024-11-10 09:35:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:35:24,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:35:24,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:35:24,708 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 [2024-11-10 09:35:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:35:24,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:35:24,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:35:24,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456280511] [2024-11-10 09:35:24,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456280511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:35:24,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:35:24,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:35:24,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066599872] [2024-11-10 09:35:24,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:35:24,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:35:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:35:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:35:24,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:35:24,733 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-11-10 09:35:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:35:25,037 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2024-11-10 09:35:25,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:35:25,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 103 [2024-11-10 09:35:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:35:25,039 INFO L225 Difference]: With dead ends: 179 [2024-11-10 09:35:25,039 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 09:35:25,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:35:25,041 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:35:25,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:35:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 09:35:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 09:35:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:35:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-10 09:35:25,053 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 103 [2024-11-10 09:35:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:35:25,054 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-10 09:35:25,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-11-10 09:35:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-10 09:35:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 09:35:25,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:35:25,056 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-10 09:35:25,084 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 [2024-11-10 09:35:25,256 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 [2024-11-10 09:35:25,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:35:25,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:35:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash -279532121, now seen corresponding path program 1 times [2024-11-10 09:35:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:35:25,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899393693] [2024-11-10 09:35:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:35:25,258 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 [2024-11-10 09:35:25,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:35:25,259 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) [2024-11-10 09:35:25,260 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 [2024-11-10 09:35:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:35:41,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:35:41,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:35:41,734 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 [2024-11-10 09:35:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:35:41,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:35:41,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:35:41,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899393693] [2024-11-10 09:35:41,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899393693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:35:41,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:35:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:35:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881938920] [2024-11-10 09:35:41,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:35:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:35:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:35:41,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:35:41,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:35:41,767 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-11-10 09:35:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:35:42,159 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2024-11-10 09:35:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:35:42,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 103 [2024-11-10 09:35:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:35:42,161 INFO L225 Difference]: With dead ends: 179 [2024-11-10 09:35:42,161 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 09:35:42,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:35:42,162 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:35:42,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:35:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 09:35:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 09:35:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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) [2024-11-10 09:35:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2024-11-10 09:35:42,183 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 103 [2024-11-10 09:35:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:35:42,184 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2024-11-10 09:35:42,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-11-10 09:35:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2024-11-10 09:35:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 09:35:42,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:35:42,192 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-10 09:35:42,229 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 [2024-11-10 09:35:42,393 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 [2024-11-10 09:35:42,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:35:42,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:35:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash 682081896, now seen corresponding path program 1 times [2024-11-10 09:35:42,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:35:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264043158] [2024-11-10 09:35:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:35:42,395 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 [2024-11-10 09:35:42,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:35:42,397 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) [2024-11-10 09:35:42,401 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