./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:36:30,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:36:30,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:36:30,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:36:30,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:36:30,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:36:30,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:36:30,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:36:30,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:36:30,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:36:30,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:36:30,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:36:30,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:36:30,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:36:30,335 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:36:30,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:36:30,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:36:30,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:36:30,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:36:30,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:36:30,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:36:30,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:36:30,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:36:30,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:36:30,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:36:30,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:36:30,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:36:30,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:36:30,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:36:30,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:36:30,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:36:30,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:36:30,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:30,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:36:30,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:36:30,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:36:30,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:36:30,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:36:30,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:36:30,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:36:30,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:36:30,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:36:30,350 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-clean/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-clean/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 -> d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 [2024-10-11 13:36:30,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:36:30,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:36:30,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:36:30,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:36:30,552 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:36:30,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2024-10-11 13:36:31,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:36:32,041 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:36:32,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2024-10-11 13:36:32,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e0b95f14/0d14a9d1099f4d2b88219410b432e01d/FLAG318739195 [2024-10-11 13:36:32,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e0b95f14/0d14a9d1099f4d2b88219410b432e01d [2024-10-11 13:36:32,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:36:32,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:36:32,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:32,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:36:32,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:36:32,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79046e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32, skipping insertion in model container [2024-10-11 13:36:32,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:36:32,669 WARN L248 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-28.i[916,929] [2024-10-11 13:36:32,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:32,718 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:36:32,731 WARN L248 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-28.i[916,929] [2024-10-11 13:36:32,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:32,770 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:36:32,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32 WrapperNode [2024-10-11 13:36:32,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:32,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:32,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:36:32,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:36:32,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,820 INFO L138 Inliner]: procedures = 29, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 616 [2024-10-11 13:36:32,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:32,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:36:32,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:36:32,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:36:32,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,853 INFO L175 MemorySlicer]: Split 152 memory accesses to 16 slices as follows [2, 5, 8, 8, 22, 20, 12, 5, 14, 14, 3, 5, 8, 6, 3, 17]. 14 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1]. [2024-10-11 13:36:32,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:36:32,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:36:32,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:36:32,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:36:32,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (1/1) ... [2024-10-11 13:36:32,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:32,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:36:32,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:36:32,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:36:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:36:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:36:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:36:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:36:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:36:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:36:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:36:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:36:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:36:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:36:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:36:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:36:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:36:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:36:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:36:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:36:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:36:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:36:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-11 13:36:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-11 13:36:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:36:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:36:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:36:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:36:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:36:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:36:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:36:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:36:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:36:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:36:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:36:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:36:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:36:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:36:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 13:36:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 13:36:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:36:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:36:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:36:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:36:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:36:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:36:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:36:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:36:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:36:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:36:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:36:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:36:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:36:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:36:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-11 13:36:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-11 13:36:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:36:32,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:36:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:36:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:36:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:36:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:36:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:36:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:36:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:36:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:36:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:36:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:36:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:36:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:36:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:36:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:36:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 13:36:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 13:36:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:36:32,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:36:33,148 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:36:33,150 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:36:33,555 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2024-10-11 13:36:33,555 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:36:33,581 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:36:33,581 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:36:33,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:33 BoogieIcfgContainer [2024-10-11 13:36:33,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:36:33,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:36:33,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:36:33,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:36:33,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:36:32" (1/3) ... [2024-10-11 13:36:33,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6797755a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:33, skipping insertion in model container [2024-10-11 13:36:33,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:32" (2/3) ... [2024-10-11 13:36:33,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6797755a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:33, skipping insertion in model container [2024-10-11 13:36:33,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:33" (3/3) ... [2024-10-11 13:36:33,590 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-28.i [2024-10-11 13:36:33,607 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:36:33,607 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:36:33,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:36:33,666 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;@5550f685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:36:33,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:36:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 13:36:33,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:33,680 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:33,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:33,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash 368745535, now seen corresponding path program 1 times [2024-10-11 13:36:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606800853] [2024-10-11 13:36:33,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:33,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:36:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:36:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:36:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:34,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:34,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606800853] [2024-10-11 13:36:34,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606800853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:34,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:34,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:36:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327863717] [2024-10-11 13:36:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:34,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:36:34,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:34,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:36:34,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:36:34,131 INFO L87 Difference]: Start difference. First operand has 116 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:36:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:34,168 INFO L93 Difference]: Finished difference Result 229 states and 358 transitions. [2024-10-11 13:36:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:36:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-10-11 13:36:34,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:34,176 INFO L225 Difference]: With dead ends: 229 [2024-10-11 13:36:34,176 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 13:36:34,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10-11 13:36:34,182 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 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-10-11 13:36:34,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 13:36:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 13:36:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2024-10-11 13:36:34,222 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 125 [2024-10-11 13:36:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:34,222 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2024-10-11 13:36:34,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:36:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2024-10-11 13:36:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 13:36:34,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:34,226 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:34,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:36:34,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:34,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1396039507, now seen corresponding path program 1 times [2024-10-11 13:36:34,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:34,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331008724] [2024-10-11 13:36:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:34,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:36:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:36:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:36:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:34,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:34,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331008724] [2024-10-11 13:36:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331008724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:34,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:36:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175449522] [2024-10-11 13:36:34,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:34,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:36:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:34,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:36:34,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:36:34,599 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:34,650 INFO L93 Difference]: Finished difference Result 230 states and 335 transitions. [2024-10-11 13:36:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:36:34,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-10-11 13:36:34,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:34,653 INFO L225 Difference]: With dead ends: 230 [2024-10-11 13:36:34,654 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 13:36:34,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-11 13:36:34,655 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:34,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 470 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:34,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 13:36:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-10-11 13:36:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-10-11 13:36:34,671 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 125 [2024-10-11 13:36:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:34,672 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-10-11 13:36:34,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-10-11 13:36:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 13:36:34,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:34,674 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:34,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:36:34,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:34,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:34,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1453297809, now seen corresponding path program 1 times [2024-10-11 13:36:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:34,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68013370] [2024-10-11 13:36:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:36:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:36:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:36:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:34,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:34,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68013370] [2024-10-11 13:36:34,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68013370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:34,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:34,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:36:34,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082631248] [2024-10-11 13:36:34,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:34,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:36:34,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:34,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:36:34,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:36:34,870 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:34,917 INFO L93 Difference]: Finished difference Result 234 states and 339 transitions. [2024-10-11 13:36:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:36:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-10-11 13:36:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:34,919 INFO L225 Difference]: With dead ends: 234 [2024-10-11 13:36:34,919 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 13:36:34,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-11 13:36:34,920 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:34,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 13:36:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-10-11 13:36:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-10-11 13:36:34,929 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 125 [2024-10-11 13:36:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:34,929 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-10-11 13:36:34,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-10-11 13:36:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 13:36:34,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:34,931 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:34,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:36:34,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:34,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1453357391, now seen corresponding path program 1 times [2024-10-11 13:36:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:34,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257310766] [2024-10-11 13:36:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:36:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:36:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:36:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:35,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:35,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257310766] [2024-10-11 13:36:35,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257310766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:35,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:35,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:35,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054512282] [2024-10-11 13:36:35,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:35,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:35,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:35,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:35,197 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:35,303 INFO L93 Difference]: Finished difference Result 311 states and 445 transitions. [2024-10-11 13:36:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-10-11 13:36:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:35,305 INFO L225 Difference]: With dead ends: 311 [2024-10-11 13:36:35,305 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 13:36:35,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:36:35,306 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 92 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:35,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 645 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 13:36:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-10-11 13:36:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 172 states have (on average 1.4011627906976745) internal successors, (241), 173 states have internal predecessors, (241), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:36:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2024-10-11 13:36:35,323 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 125 [2024-10-11 13:36:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:35,323 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2024-10-11 13:36:35,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2024-10-11 13:36:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:36:35,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:35,325 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:35,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:36:35,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:35,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1251747491, now seen corresponding path program 1 times [2024-10-11 13:36:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:35,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770554596] [2024-10-11 13:36:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:35,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:36:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:36:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:36:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770554596] [2024-10-11 13:36:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770554596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298377495] [2024-10-11 13:36:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:35,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:35,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:35,461 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:35,489 INFO L93 Difference]: Finished difference Result 387 states and 553 transitions. [2024-10-11 13:36:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-10-11 13:36:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:35,491 INFO L225 Difference]: With dead ends: 387 [2024-10-11 13:36:35,491 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 13:36:35,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-10-11 13:36:35,492 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:35,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 625 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 13:36:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-10-11 13:36:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.3876404494382022) internal successors, (247), 179 states have internal predecessors, (247), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:36:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 279 transitions. [2024-10-11 13:36:35,501 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 279 transitions. Word has length 127 [2024-10-11 13:36:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:35,501 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 279 transitions. [2024-10-11 13:36:35,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2024-10-11 13:36:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:36:35,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:35,502 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:35,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:36:35,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:35,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -519233452, now seen corresponding path program 1 times [2024-10-11 13:36:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125542037] [2024-10-11 13:36:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:36:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:36:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:36:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125542037] [2024-10-11 13:36:35,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125542037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:35,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:35,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:36:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897598400] [2024-10-11 13:36:35,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:35,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:36:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:35,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:36:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:36:35,781 INFO L87 Difference]: Start difference. First operand 197 states and 279 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:35,992 INFO L93 Difference]: Finished difference Result 716 states and 1006 transitions. [2024-10-11 13:36:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:36:35,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-10-11 13:36:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:35,995 INFO L225 Difference]: With dead ends: 716 [2024-10-11 13:36:35,995 INFO L226 Difference]: Without dead ends: 520 [2024-10-11 13:36:35,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:36:35,996 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 277 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:35,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 857 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:36:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-11 13:36:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 376. [2024-10-11 13:36:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 349 states have (on average 1.4011461318051577) internal successors, (489), 352 states have internal predecessors, (489), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:36:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 533 transitions. [2024-10-11 13:36:36,020 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 533 transitions. Word has length 127 [2024-10-11 13:36:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:36,021 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 533 transitions. [2024-10-11 13:36:36,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 533 transitions. [2024-10-11 13:36:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:36:36,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:36,022 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:36,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:36:36,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:36,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1799097130, now seen corresponding path program 1 times [2024-10-11 13:36:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767768952] [2024-10-11 13:36:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:36:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:36:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:36:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767768952] [2024-10-11 13:36:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767768952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:36,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:36,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702627833] [2024-10-11 13:36:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:36,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:36,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:36,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:36,347 INFO L87 Difference]: Start difference. First operand 376 states and 533 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:36,444 INFO L93 Difference]: Finished difference Result 780 states and 1101 transitions. [2024-10-11 13:36:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:36:36,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-10-11 13:36:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:36,447 INFO L225 Difference]: With dead ends: 780 [2024-10-11 13:36:36,447 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 13:36:36,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:36,449 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 111 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:36,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 554 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 13:36:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2024-10-11 13:36:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 369 states have (on average 1.3902439024390243) internal successors, (513), 373 states have internal predecessors, (513), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:36:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 565 transitions. [2024-10-11 13:36:36,470 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 565 transitions. Word has length 127 [2024-10-11 13:36:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:36,470 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 565 transitions. [2024-10-11 13:36:36,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 565 transitions. [2024-10-11 13:36:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:36:36,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:36,472 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:36,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:36:36,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:36,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:36,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1525391513, now seen corresponding path program 1 times [2024-10-11 13:36:36,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:36,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241552161] [2024-10-11 13:36:36,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:36,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:36:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:36:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:36:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:36,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:36,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241552161] [2024-10-11 13:36:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241552161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:36,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:36,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:36:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73340970] [2024-10-11 13:36:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:36:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:36:36,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:36:36,619 INFO L87 Difference]: Start difference. First operand 402 states and 565 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:36,653 INFO L93 Difference]: Finished difference Result 777 states and 1095 transitions. [2024-10-11 13:36:36,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:36:36,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2024-10-11 13:36:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:36,659 INFO L225 Difference]: With dead ends: 777 [2024-10-11 13:36:36,660 INFO L226 Difference]: Without dead ends: 402 [2024-10-11 13:36:36,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-10-11 13:36:36,661 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:36,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-11 13:36:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-10-11 13:36:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 369 states have (on average 1.3739837398373984) internal successors, (507), 373 states have internal predecessors, (507), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:36:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 559 transitions. [2024-10-11 13:36:36,672 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 559 transitions. Word has length 129 [2024-10-11 13:36:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:36,672 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 559 transitions. [2024-10-11 13:36:36,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 559 transitions. [2024-10-11 13:36:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:36:36,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:36,673 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:36,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:36:36,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:36,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash -163552229, now seen corresponding path program 1 times [2024-10-11 13:36:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814412586] [2024-10-11 13:36:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:36:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:36:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:36:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:36:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:36:37,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:37,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814412586] [2024-10-11 13:36:37,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814412586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:36:37,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348084097] [2024-10-11 13:36:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:37,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:36:37,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:36:37,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:36:37,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:36:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:37,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 13:36:37,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:37,621 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-10-11 13:36:37,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 13:36:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 13:36:37,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:37,981 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 32 treesize of output 28 [2024-10-11 13:36:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:36:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348084097] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:36:38,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:36:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 22 [2024-10-11 13:36:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33749621] [2024-10-11 13:36:38,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:36:38,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 13:36:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:38,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 13:36:38,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:36:38,040 INFO L87 Difference]: Start difference. First operand 402 states and 559 transitions. Second operand has 22 states, 19 states have (on average 6.947368421052632) internal successors, (132), 22 states have internal predecessors, (132), 8 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 5 states have call predecessors, (42), 8 states have call successors, (42) [2024-10-11 13:36:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:38,654 INFO L93 Difference]: Finished difference Result 610 states and 844 transitions. [2024-10-11 13:36:38,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:36:38,655 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.947368421052632) internal successors, (132), 22 states have internal predecessors, (132), 8 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 5 states have call predecessors, (42), 8 states have call successors, (42) Word has length 129 [2024-10-11 13:36:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:38,656 INFO L225 Difference]: With dead ends: 610 [2024-10-11 13:36:38,656 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 13:36:38,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 13:36:38,657 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 606 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:38,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1208 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:36:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 13:36:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-10-11 13:36:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 209 states have internal predecessors, (279), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:36:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 319 transitions. [2024-10-11 13:36:38,666 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 319 transitions. Word has length 129 [2024-10-11 13:36:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:38,667 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 319 transitions. [2024-10-11 13:36:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.947368421052632) internal successors, (132), 22 states have internal predecessors, (132), 8 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 5 states have call predecessors, (42), 8 states have call successors, (42) [2024-10-11 13:36:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 319 transitions. [2024-10-11 13:36:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:36:38,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:38,668 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:38,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:36:38,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:36:38,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:38,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1412211633, now seen corresponding path program 1 times [2024-10-11 13:36:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:38,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364160760] [2024-10-11 13:36:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:38,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:36:38,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:36:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:36:39,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:36:39,067 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:36:39,068 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:36:39,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:36:39,072 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:39,204 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:36:39,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:36:39 BoogieIcfgContainer [2024-10-11 13:36:39,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:36:39,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:36:39,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:36:39,207 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:36:39,208 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:33" (3/4) ... [2024-10-11 13:36:39,209 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:36:39,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:36:39,210 INFO L158 Benchmark]: Toolchain (without parser) took 6780.01ms. Allocated memory was 169.9MB in the beginning and 362.8MB in the end (delta: 192.9MB). Free memory was 100.6MB in the beginning and 292.9MB in the end (delta: -192.3MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2024-10-11 13:36:39,211 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory was 131.7MB in the beginning and 131.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:36:39,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.65ms. Allocated memory is still 169.9MB. Free memory was 100.3MB in the beginning and 131.8MB in the end (delta: -31.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 13:36:39,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.30ms. Allocated memory is still 169.9MB. Free memory was 131.8MB in the beginning and 128.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:36:39,211 INFO L158 Benchmark]: Boogie Preprocessor took 62.73ms. Allocated memory is still 169.9MB. Free memory was 128.2MB in the beginning and 121.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:36:39,211 INFO L158 Benchmark]: RCFGBuilder took 699.42ms. Allocated memory is still 169.9MB. Free memory was 121.9MB in the beginning and 125.0MB in the end (delta: -3.1MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2024-10-11 13:36:39,212 INFO L158 Benchmark]: TraceAbstraction took 5621.99ms. Allocated memory was 169.9MB in the beginning and 362.8MB in the end (delta: 192.9MB). Free memory was 123.9MB in the beginning and 292.9MB in the end (delta: -169.0MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. [2024-10-11 13:36:39,212 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 362.8MB. Free memory is still 292.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:36:39,213 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.14ms. Allocated memory is still 169.9MB. Free memory was 131.7MB in the beginning and 131.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.65ms. Allocated memory is still 169.9MB. Free memory was 100.3MB in the beginning and 131.8MB in the end (delta: -31.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.30ms. Allocated memory is still 169.9MB. Free memory was 131.8MB in the beginning and 128.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.73ms. Allocated memory is still 169.9MB. Free memory was 128.2MB in the beginning and 121.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 699.42ms. Allocated memory is still 169.9MB. Free memory was 121.9MB in the beginning and 125.0MB in the end (delta: -3.1MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5621.99ms. Allocated memory was 169.9MB in the beginning and 362.8MB in the end (delta: 192.9MB). Free memory was 123.9MB in the beginning and 292.9MB in the end (delta: -169.0MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 362.8MB. Free memory is still 292.9MB. 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 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L22] signed char var_1_1 = 1; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] float var_1_2 = 63.75; [L24] float var_1_2 = 63.75; [L25] float* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 255.75; [L26] float var_1_3 = 255.75; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] signed char var_1_5 = 10; [L28] signed char var_1_5 = 10; [L29] signed char* var_1_5_Pointer = &(var_1_5); [L30] signed char var_1_6 = 4; [L30] signed char var_1_6 = 4; [L31] signed char* var_1_6_Pointer = &(var_1_6); [L32] signed char var_1_7 = -10; [L32] signed char var_1_7 = -10; [L33] signed char* var_1_7_Pointer = &(var_1_7); [L34] float var_1_8 = 4.75; [L34] float var_1_8 = 4.75; [L35] float* var_1_8_Pointer = &(var_1_8); [L36] float var_1_9 = 99.5; [L36] float var_1_9 = 99.5; [L37] float* var_1_9_Pointer = &(var_1_9); [L38] float var_1_10 = 255.9; [L38] float var_1_10 = 255.9; [L39] float* var_1_10_Pointer = &(var_1_10); [L40] float var_1_11 = 24.85; [L40] float var_1_11 = 24.85; [L41] float* var_1_11_Pointer = &(var_1_11); [L42] signed long int var_1_12 = -2; [L42] signed long int var_1_12 = -2; [L43] signed long int* var_1_12_Pointer = &(var_1_12); [L44] signed long int var_1_13 = 1629954775; [L44] signed long int var_1_13 = 1629954775; [L45] signed long int* var_1_13_Pointer = &(var_1_13); [L46] signed long int var_1_15 = 1928642731; [L46] signed long int var_1_15 = 1928642731; [L47] signed long int* var_1_15_Pointer = &(var_1_15); [L48] signed short int var_1_18 = 0; [L48] signed short int var_1_18 = 0; [L49] signed short int* var_1_18_Pointer = &(var_1_18); [L50] unsigned short int var_1_19 = 5; [L50] unsigned short int var_1_19 = 5; [L51] unsigned short int* var_1_19_Pointer = &(var_1_19); [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_float() [L76] EXPR \read(var_1_2) [L76] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F [L76] EXPR \read(var_1_2) [L76] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR (var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR (var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L77] var_1_3 = __VERIFIER_nondet_float() [L78] EXPR \read(var_1_3) [L78] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F [L78] EXPR \read(var_1_3) [L78] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L79] var_1_5 = __VERIFIER_nondet_char() [L80] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L80] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L80] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L82] var_1_6 = __VERIFIER_nondet_char() [L83] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] var_1_7 = __VERIFIER_nondet_char() [L86] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] var_1_9 = __VERIFIER_nondet_float() [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] var_1_10 = __VERIFIER_nondet_float() [L91] EXPR \read(var_1_10) [L91] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F [L91] EXPR \read(var_1_10) [L91] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] var_1_13 = __VERIFIER_nondet_long() [L93] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] var_1_15 = __VERIFIER_nondet_long() [L96] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] RET updateVariables() [L111] CALL step() [L55] signed long int stepLocal_0 = -4; [L56] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L56] COND TRUE stepLocal_0 < (*(var_1_6_Pointer)) [L57] EXPR \read(*var_1_9_Pointer) [L57] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] EXPR (((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) [L57] EXPR \read(*var_1_9_Pointer) [L57] EXPR (((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] (*(var_1_8_Pointer)) = (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L59] EXPR (((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR (((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L59] (*(var_1_11_Pointer)) = (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))) [L60] EXPR \read(*var_1_5_Pointer) [L60] (*(var_1_18_Pointer)) = (*(var_1_5_Pointer)) [L61] EXPR \read(*var_1_6_Pointer) [L61] (*(var_1_19_Pointer)) = (*(var_1_6_Pointer)) [L62] EXPR \read(*var_1_2_Pointer) [L62] EXPR \read(*var_1_3_Pointer) [L62] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L62] COND FALSE !(((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) [L65] EXPR \read(*var_1_5_Pointer) [L65] (*(var_1_1_Pointer)) = (*(var_1_5_Pointer)) [L67] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] EXPR (*(var_1_6_Pointer)) | 5 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] signed long int stepLocal_1 = (*(var_1_6_Pointer)) | 5; [L68] EXPR \read(*var_1_5_Pointer) [L68] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L68] EXPR (((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer))) [L68] EXPR \read(*var_1_5_Pointer) [L68] EXPR (((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, stepLocal_1=5, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L68] COND FALSE !(stepLocal_1 <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) [L71] EXPR \read(*var_1_6_Pointer) [L71] EXPR \read(*var_1_19_Pointer) [L71] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L71] EXPR (((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))) [L71] EXPR \read(*var_1_19_Pointer) [L71] EXPR (((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L71] EXPR \read(*var_1_19_Pointer) [L71] (*(var_1_12_Pointer)) = ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR \read(*var_1_2_Pointer) [L102] EXPR \read(*var_1_3_Pointer) [L102] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) [L102] EXPR \read(*var_1_1_Pointer) [L102] EXPR \read(*var_1_5_Pointer) [L102] EXPR \read(*var_1_6_Pointer) [L102] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))) [L102] EXPR \read(*var_1_5_Pointer) [L102] EXPR \read(*var_1_6_Pointer) [L102] EXPR ((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102-L103] return ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1088 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1088 mSDsluCounter, 5312 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3929 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1347 IncrementalHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 1383 mSDtfsCounter, 1347 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 589 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=7, InterpolantAutomatonStates: 53, 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, 9 MinimizatonAttempts, 152 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1397 NumberOfCodeBlocks, 1397 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1386 ConstructedInterpolants, 0 QuantifiedInterpolants, 3183 SizeOfPredicates, 7 NumberOfNonLiveVariables, 620 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 3757/4004 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-10-11 13:36:39,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:36:41,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:36:41,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:36:41,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:36:41,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:36:41,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:36:41,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:36:41,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:36:41,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:36:41,631 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:36:41,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:36:41,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:36:41,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:36:41,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:36:41,634 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:36:41,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:36:41,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:36:41,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:36:41,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:36:41,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:36:41,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:36:41,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:36:41,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:36:41,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:36:41,639 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:36:41,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:36:41,639 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:36:41,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:36:41,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:36:41,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:36:41,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:36:41,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:36:41,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:36:41,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:36:41,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:41,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:36:41,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:36:41,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:36:41,641 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:36:41,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:36:41,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:36:41,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:36:41,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:36:41,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:36:41,643 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:36:41,644 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-clean/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-clean/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 -> d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 [2024-10-11 13:36:41,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:36:41,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:36:41,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:36:41,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:36:41,910 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:36:41,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2024-10-11 13:36:43,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:36:43,559 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:36:43,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2024-10-11 13:36:43,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fbd1c7568/f692411308e64b2f8f7791305e11f770/FLAGf55e3e13a [2024-10-11 13:36:43,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fbd1c7568/f692411308e64b2f8f7791305e11f770 [2024-10-11 13:36:43,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:36:43,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:36:43,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:43,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:36:43,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:36:43,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:43" (1/1) ... [2024-10-11 13:36:43,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e46979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:43, skipping insertion in model container [2024-10-11 13:36:43,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:43" (1/1) ... [2024-10-11 13:36:43,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:36:44,139 WARN L248 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-28.i[916,929] [2024-10-11 13:36:44,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:44,210 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:36:44,220 WARN L248 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-28.i[916,929] [2024-10-11 13:36:44,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:44,280 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:36:44,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44 WrapperNode [2024-10-11 13:36:44,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:44,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:44,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:36:44,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:36:44,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,348 INFO L138 Inliner]: procedures = 36, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 594 [2024-10-11 13:36:44,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:44,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:36:44,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:36:44,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:36:44,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,389 INFO L175 MemorySlicer]: Split 152 memory accesses to 16 slices as follows [2, 5, 8, 8, 22, 20, 12, 5, 14, 14, 3, 5, 8, 6, 3, 17]. 14 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1]. [2024-10-11 13:36:44,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:36:44,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:36:44,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:36:44,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:36:44,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (1/1) ... [2024-10-11 13:36:44,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:36:44,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:36:44,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:36:44,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:36:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:36:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:36:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:36:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:36:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:36:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:36:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:36:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:36:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:36:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:36:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-11 13:36:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-11 13:36:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-11 13:36:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-11 13:36:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-11 13:36:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-11 13:36:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:36:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:36:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:36:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:36:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:36:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:36:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:36:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:36:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:36:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:36:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-11 13:36:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-11 13:36:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-11 13:36:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-11 13:36:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-11 13:36:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-11 13:36:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:36:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:36:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:36:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:36:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:36:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:36:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:36:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:36:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:36:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-11 13:36:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:36:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:36:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-11 13:36:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:36:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:36:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-11 13:36:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:36:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:36:44,543 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:36:44,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:36:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:36:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-11 13:36:44,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 13:36:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-11 13:36:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-11 13:36:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-11 13:36:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-11 13:36:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-11 13:36:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-10-11 13:36:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-10-11 13:36:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-10-11 13:36:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-10-11 13:36:44,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:36:44,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:36:45,345 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-10-11 13:36:45,345 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:36:45,397 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:36:45,398 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:36:45,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:45 BoogieIcfgContainer [2024-10-11 13:36:45,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:36:45,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:36:45,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:36:45,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:36:45,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:36:43" (1/3) ... [2024-10-11 13:36:45,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2293a552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:45, skipping insertion in model container [2024-10-11 13:36:45,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:44" (2/3) ... [2024-10-11 13:36:45,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2293a552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:45, skipping insertion in model container [2024-10-11 13:36:45,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:45" (3/3) ... [2024-10-11 13:36:45,405 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-28.i [2024-10-11 13:36:45,416 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:36:45,416 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:36:45,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:36:45,474 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;@2791306d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:36:45,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:36:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 13:36:45,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:45,489 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:45,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:45,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash -257213236, now seen corresponding path program 1 times [2024-10-11 13:36:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:45,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515913204] [2024-10-11 13:36:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:45,506 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-10-11 13:36:45,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:45,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 13:36:45,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:45,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:36:45,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-10-11 13:36:45,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:45,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:45,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515913204] [2024-10-11 13:36:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515913204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:45,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:45,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:36:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837269037] [2024-10-11 13:36:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:45,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:36:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:36:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:36:45,987 INFO L87 Difference]: Start difference. First operand has 108 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:36:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:46,042 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2024-10-11 13:36:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:36:46,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-10-11 13:36:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:46,051 INFO L225 Difference]: With dead ends: 213 [2024-10-11 13:36:46,052 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 13:36:46,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-10-11 13:36:46,059 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 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-10-11 13:36:46,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 13:36:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 13:36:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2024-10-11 13:36:46,100 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 123 [2024-10-11 13:36:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:46,100 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2024-10-11 13:36:46,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:36:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2024-10-11 13:36:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 13:36:46,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:46,103 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:46,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:46,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 13:36:46,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1337707296, now seen corresponding path program 1 times [2024-10-11 13:36:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917775637] [2024-10-11 13:36:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:46,307 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-10-11 13:36:46,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:46,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 13:36:46,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:46,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:36:46,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:47,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 13:36:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 13:36:47,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:47,337 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:36:47,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-10-11 13:36:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:36:47,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917775637] [2024-10-11 13:36:47,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917775637] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:36:47,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:36:47,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-11 13:36:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122334326] [2024-10-11 13:36:47,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:36:47,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:36:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:47,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:36:47,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:36:47,451 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 13 states have internal predecessors, (86), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-10-11 13:36:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:48,067 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-10-11 13:36:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:36:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 13 states have internal predecessors, (86), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) Word has length 123 [2024-10-11 13:36:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:48,069 INFO L225 Difference]: With dead ends: 215 [2024-10-11 13:36:48,069 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 13:36:48,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:36:48,070 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 327 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:48,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 664 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:36:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 13:36:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 13:36:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-10-11 13:36:48,091 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 123 [2024-10-11 13:36:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:48,091 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-10-11 13:36:48,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 13 states have internal predecessors, (86), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-10-11 13:36:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-10-11 13:36:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 13:36:48,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:48,093 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:48,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:48,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 13:36:48,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:48,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:48,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1826005573, now seen corresponding path program 1 times [2024-10-11 13:36:48,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:48,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479087917] [2024-10-11 13:36:48,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:48,295 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-10-11 13:36:48,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:48,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 13:36:48,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:48,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:36:48,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:48,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:48,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:48,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479087917] [2024-10-11 13:36:48,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479087917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:48,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:48,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:36:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859056259] [2024-10-11 13:36:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:48,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:36:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:48,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:36:48,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:48,707 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:48,787 INFO L93 Difference]: Finished difference Result 226 states and 325 transitions. [2024-10-11 13:36:48,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:36:48,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-10-11 13:36:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:48,793 INFO L225 Difference]: With dead ends: 226 [2024-10-11 13:36:48,793 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 13:36:48,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:48,801 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:48,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 707 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 13:36:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-10-11 13:36:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-10-11 13:36:48,816 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 125 [2024-10-11 13:36:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:48,817 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-10-11 13:36:48,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-10-11 13:36:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 13:36:48,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:48,819 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:48,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:49,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 13:36:49,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:49,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1768747271, now seen corresponding path program 1 times [2024-10-11 13:36:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:49,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606810585] [2024-10-11 13:36:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:49,024 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-10-11 13:36:49,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:49,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 13:36:49,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:36:49,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:49,439 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-10-11 13:36:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:49,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:49,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:49,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606810585] [2024-10-11 13:36:49,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606810585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:49,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:49,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:49,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915110821] [2024-10-11 13:36:49,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:49,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:36:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:49,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:36:49,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:49,462 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:49,963 INFO L93 Difference]: Finished difference Result 232 states and 328 transitions. [2024-10-11 13:36:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:36:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-10-11 13:36:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:49,970 INFO L225 Difference]: With dead ends: 232 [2024-10-11 13:36:49,972 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 13:36:49,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:36:49,973 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 152 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:49,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 486 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:36:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 13:36:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-10-11 13:36:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2024-10-11 13:36:49,981 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 125 [2024-10-11 13:36:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:49,982 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2024-10-11 13:36:49,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-10-11 13:36:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:36:49,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:49,983 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:49,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:50,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 13:36:50,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:50,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1245034111, now seen corresponding path program 1 times [2024-10-11 13:36:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:50,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799532072] [2024-10-11 13:36:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:50,185 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-10-11 13:36:50,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:50,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 13:36:50,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:36:50,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:50,605 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-10-11 13:36:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 13:36:50,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:50,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799532072] [2024-10-11 13:36:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799532072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:50,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:50,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:50,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204093868] [2024-10-11 13:36:50,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:50,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:36:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:50,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:36:50,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:50,624 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:36:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:51,017 INFO L93 Difference]: Finished difference Result 232 states and 326 transitions. [2024-10-11 13:36:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:36:51,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-10-11 13:36:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:51,018 INFO L225 Difference]: With dead ends: 232 [2024-10-11 13:36:51,018 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 13:36:51,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:36:51,019 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 140 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:51,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 480 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:36:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 13:36:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-10-11 13:36:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-10-11 13:36:51,039 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 127 [2024-10-11 13:36:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:51,039 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-10-11 13:36:51,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:36:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-10-11 13:36:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:36:51,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:51,040 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:51,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:51,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 13:36:51,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:51,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1363640519, now seen corresponding path program 1 times [2024-10-11 13:36:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147276721] [2024-10-11 13:36:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:51,242 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-10-11 13:36:51,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:51,245 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 13:36:51,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:36:51,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:51,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:36:51,903 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 54 treesize of output 42 [2024-10-11 13:36:51,906 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 54 treesize of output 34 [2024-10-11 13:36:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 132 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-10-11 13:36:51,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:52,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147276721] [2024-10-11 13:36:52,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147276721] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:36:52,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:36:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-11 13:36:52,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988745812] [2024-10-11 13:36:52,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:52,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:52,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:52,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:36:52,059 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:52,628 INFO L93 Difference]: Finished difference Result 301 states and 419 transitions. [2024-10-11 13:36:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:52,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2024-10-11 13:36:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:52,630 INFO L225 Difference]: With dead ends: 301 [2024-10-11 13:36:52,630 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 13:36:52,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:36:52,631 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 82 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:52,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 587 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:36:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 13:36:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2024-10-11 13:36:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 164 states have internal predecessors, (223), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:36:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 255 transitions. [2024-10-11 13:36:52,650 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 255 transitions. Word has length 129 [2024-10-11 13:36:52,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:52,651 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 255 transitions. [2024-10-11 13:36:52,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 255 transitions. [2024-10-11 13:36:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:36:52,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:52,655 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:52,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:52,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-11 13:36:52,856 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:52,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1455844135, now seen corresponding path program 1 times [2024-10-11 13:36:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325966761] [2024-10-11 13:36:52,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:52,858 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-10-11 13:36:52,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:52,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-11 13:36:52,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:36:53,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:53,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 13:36:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 13:36:53,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:54,043 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:36:54,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-10-11 13:36:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:36:54,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325966761] [2024-10-11 13:36:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325966761] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:36:54,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:36:54,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-11 13:36:54,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487074373] [2024-10-11 13:36:54,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:36:54,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:36:54,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:54,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:36:54,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:36:54,157 INFO L87 Difference]: Start difference. First operand 183 states and 255 transitions. Second operand has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-10-11 13:36:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:55,225 INFO L93 Difference]: Finished difference Result 365 states and 509 transitions. [2024-10-11 13:36:55,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:36:55,229 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) Word has length 131 [2024-10-11 13:36:55,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:55,231 INFO L225 Difference]: With dead ends: 365 [2024-10-11 13:36:55,231 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 13:36:55,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:36:55,232 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 194 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:55,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 649 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:36:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 13:36:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-11 13:36:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 164 states have internal predecessors, (221), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:36:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 253 transitions. [2024-10-11 13:36:55,252 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 253 transitions. Word has length 131 [2024-10-11 13:36:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:55,252 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 253 transitions. [2024-10-11 13:36:55,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-10-11 13:36:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 253 transitions. [2024-10-11 13:36:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:36:55,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:55,256 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:55,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:36:55,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-11 13:36:55,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:55,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2106609122, now seen corresponding path program 1 times [2024-10-11 13:36:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277525711] [2024-10-11 13:36:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:55,458 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-10-11 13:36:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:55,460 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 13:36:55,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 13:36:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 13:36:55,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:56,198 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 28 treesize of output 20 [2024-10-11 13:36:56,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 13:36:56,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 13:36:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 13:36:56,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:36:56,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:56,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277525711] [2024-10-11 13:36:56,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277525711] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:36:56,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:36:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 13:36:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388571391] [2024-10-11 13:36:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:56,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:36:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:36:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:36:56,323 INFO L87 Difference]: Start difference. First operand 183 states and 253 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:56,357 INFO L93 Difference]: Finished difference Result 365 states and 505 transitions. [2024-10-11 13:36:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:36:56,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2024-10-11 13:36:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:56,359 INFO L225 Difference]: With dead ends: 365 [2024-10-11 13:36:56,359 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 13:36:56,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:36:56,360 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:56,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 13:36:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-11 13:36:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 163 states have (on average 1.343558282208589) internal successors, (219), 164 states have internal predecessors, (219), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:36:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 251 transitions. [2024-10-11 13:36:56,368 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 251 transitions. Word has length 131 [2024-10-11 13:36:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:56,369 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 251 transitions. [2024-10-11 13:36:56,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:36:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 251 transitions. [2024-10-11 13:36:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:36:56,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:56,370 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:36:56,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:56,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 13:36:56,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:56,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 499414432, now seen corresponding path program 1 times [2024-10-11 13:36:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:56,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531591528] [2024-10-11 13:36:56,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:56,572 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-10-11 13:36:56,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:56,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 13:36:56,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 13:37:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:16,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 13:37:16,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:21,625 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 91 treesize of output 43 [2024-10-11 13:37:21,794 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-10-11 13:37:28,086 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 107 treesize of output 71 [2024-10-11 13:37:28,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 59 [2024-10-11 13:37:28,099 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 87 treesize of output 51 [2024-10-11 13:37:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 238 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 13:37:30,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:37:40,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:40,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531591528] [2024-10-11 13:37:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531591528] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:40,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:37:40,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [30] total 34 [2024-10-11 13:37:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823858586] [2024-10-11 13:37:40,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:40,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1025, Unknown=1, NotChecked=0, Total=1122 [2024-10-11 13:37:40,749 INFO L87 Difference]: Start difference. First operand 183 states and 251 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:37:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:51,566 INFO L93 Difference]: Finished difference Result 361 states and 494 transitions. [2024-10-11 13:37:51,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:37:51,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2024-10-11 13:37:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:51,573 INFO L225 Difference]: With dead ends: 361 [2024-10-11 13:37:51,573 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 13:37:51,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=101, Invalid=1087, Unknown=2, NotChecked=0, Total=1190 [2024-10-11 13:37:51,574 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 102 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:51,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 419 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-10-11 13:37:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 13:37:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2024-10-11 13:37:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.3375796178343948) internal successors, (210), 158 states have internal predecessors, (210), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:37:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2024-10-11 13:37:51,580 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 131 [2024-10-11 13:37:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:51,581 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2024-10-11 13:37:51,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:37:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2024-10-11 13:37:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:37:51,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:51,582 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:37:51,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 13:37:51,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 13:37:51,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:51,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1140613558, now seen corresponding path program 1 times [2024-10-11 13:37:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149982390] [2024-10-11 13:37:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:51,787 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-10-11 13:37:51,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:51,789 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 13:37:51,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 13:38:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:05,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 13:38:05,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:38:11,356 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 91 treesize of output 43 [2024-10-11 13:38:11,646 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