./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-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8118e579ef4e3ad5faaa9b6d928fc4dda4bd859822f258d10da0e3bf596f403 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:42:50,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:42:50,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:42:50,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:42:50,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:42:50,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:42:50,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:42:50,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:42:50,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:42:50,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:42:50,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:42:50,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:42:50,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:42:50,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:42:50,981 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:42:50,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:42:50,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:42:50,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:42:50,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:42:50,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:42:50,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:42:50,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:42:50,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:42:50,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:42:50,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:42:50,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:42:50,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:42:50,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:42:50,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:42:50,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:42:50,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:42:50,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:42:50,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:42:50,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:42:50,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:42:50,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:42:50,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:42:50,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:42:50,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:42:50,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:42:50,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:42:50,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:42:50,997 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8118e579ef4e3ad5faaa9b6d928fc4dda4bd859822f258d10da0e3bf596f403 [2024-10-14 13:42:51,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:42:51,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:42:51,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:42:51,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:42:51,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:42:51,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-17.i [2024-10-14 13:42:52,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:42:52,990 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:42:52,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-17.i [2024-10-14 13:42:53,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3bb1d831/0d1b28540d0b4553847a50d7103afb3f/FLAG7b7b051ab [2024-10-14 13:42:53,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3bb1d831/0d1b28540d0b4553847a50d7103afb3f [2024-10-14 13:42:53,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:42:53,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:42:53,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:42:53,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:42:53,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:42:53,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c8b418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53, skipping insertion in model container [2024-10-14 13:42:53,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:42:53,211 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-17.i[916,929] [2024-10-14 13:42:53,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:42:53,276 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:42:53,289 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-17.i[916,929] [2024-10-14 13:42:53,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:42:53,386 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:42:53,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53 WrapperNode [2024-10-14 13:42:53,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:42:53,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:42:53,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:42:53,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:42:53,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,497 INFO L138 Inliner]: procedures = 29, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 662 [2024-10-14 13:42:53,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:42:53,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:42:53,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:42:53,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:42:53,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,562 INFO L175 MemorySlicer]: Split 156 memory accesses to 17 slices as follows [2, 3, 8, 18, 14, 26, 7, 10, 10, 8, 6, 6, 5, 3, 8, 14, 8]. 17 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-10-14 13:42:53,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:42:53,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:42:53,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:42:53,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:42:53,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (1/1) ... [2024-10-14 13:42:53,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:42:53,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:42:53,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:42:53,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:42:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:42:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:42:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:42:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:42:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:42:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:42:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-14 13:42:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-14 13:42:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-14 13:42:53,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-14 13:42:53,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-14 13:42:53,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-14 13:42:53,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-14 13:42:53,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-14 13:42:53,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-14 13:42:53,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-14 13:42:53,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-14 13:42:53,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:42:53,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:42:53,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:42:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:42:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:42:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:42:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-14 13:42:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-14 13:42:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-14 13:42:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-14 13:42:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-14 13:42:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-14 13:42:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-14 13:42:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-14 13:42:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-14 13:42:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-14 13:42:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2024-10-14 13:42:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:42:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:42:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:42:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:42:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:42:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:42:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 13:42:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-14 13:42:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-14 13:42:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-14 13:42:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:42:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:42:53,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-14 13:42:53,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-14 13:42:53,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-14 13:42:53,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-14 13:42:53,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-14 13:42:53,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-14 13:42:53,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-14 13:42:53,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-14 13:42:53,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-14 13:42:53,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:42:53,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 13:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 13:42:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 13:42:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 13:42:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 13:42:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 13:42:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 13:42:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 13:42:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 13:42:53,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 13:42:53,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 13:42:53,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:42:53,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:42:53,974 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:42:53,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:42:54,597 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2024-10-14 13:42:54,597 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:42:54,649 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:42:54,649 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:42:54,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:42:54 BoogieIcfgContainer [2024-10-14 13:42:54,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:42:54,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:42:54,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:42:54,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:42:54,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:42:53" (1/3) ... [2024-10-14 13:42:54,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537657ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:42:54, skipping insertion in model container [2024-10-14 13:42:54,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:42:53" (2/3) ... [2024-10-14 13:42:54,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537657ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:42:54, skipping insertion in model container [2024-10-14 13:42:54,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:42:54" (3/3) ... [2024-10-14 13:42:54,659 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-17.i [2024-10-14 13:42:54,676 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:42:54,676 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:42:54,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:42:54,781 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;@406867a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:42:54,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:42:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:42:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 13:42:54,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:42:54,809 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:42:54,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:42:54,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:42:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1140966049, now seen corresponding path program 1 times [2024-10-14 13:42:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:42:54,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959543464] [2024-10-14 13:42:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:42:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:42:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:42:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:42:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:42:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:42:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:42:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:42:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:42:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:42:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:42:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:42:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:42:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:42:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:42:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:42:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:42:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:42:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:42:55,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:42:55,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959543464] [2024-10-14 13:42:55,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959543464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:42:55,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:42:55,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:42:55,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185561983] [2024-10-14 13:42:55,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:42:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:42:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:42:55,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:42:55,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:42:55,358 INFO L87 Difference]: Start difference. First operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:42:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:42:55,463 INFO L93 Difference]: Finished difference Result 271 states and 428 transitions. [2024-10-14 13:42:55,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:42:55,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-14 13:42:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:42:55,476 INFO L225 Difference]: With dead ends: 271 [2024-10-14 13:42:55,480 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 13:42:55,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-14 13:42:55,497 INFO L432 NwaCegarLoop]: 198 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, 198 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:42:55,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:42:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 13:42:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-14 13:42:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.452991452991453) internal successors, (170), 117 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:42:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-14 13:42:55,585 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 136 [2024-10-14 13:42:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:42:55,585 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-14 13:42:55,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:42:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-14 13:42:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 13:42:55,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:42:55,594 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:42:55,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:42:55,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:42:55,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:42:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1612411427, now seen corresponding path program 1 times [2024-10-14 13:42:55,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:42:55,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121692705] [2024-10-14 13:42:55,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:42:55,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:42:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:42:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:42:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:42:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:42:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:42:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:42:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:42:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:42:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:42:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:42:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:42:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:42:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:42:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:42:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:42:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:42:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:42:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:42:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121692705] [2024-10-14 13:42:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121692705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:42:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:42:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:42:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478028935] [2024-10-14 13:42:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:42:55,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:42:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:42:55,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:42:55,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:42:55,988 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:42:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:42:56,061 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2024-10-14 13:42:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:42:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-14 13:42:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:42:56,063 INFO L225 Difference]: With dead ends: 271 [2024-10-14 13:42:56,063 INFO L226 Difference]: Without dead ends: 137 [2024-10-14 13:42:56,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-14 13:42:56,066 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:42:56,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:42:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-14 13:42:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-14 13:42:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:42:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2024-10-14 13:42:56,080 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 136 [2024-10-14 13:42:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:42:56,081 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2024-10-14 13:42:56,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:42:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2024-10-14 13:42:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 13:42:56,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:42:56,088 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:42:56,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:42:56,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:42:56,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:42:56,092 INFO L85 PathProgramCache]: Analyzing trace with hash -632146971, now seen corresponding path program 1 times [2024-10-14 13:42:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:42:56,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387783724] [2024-10-14 13:42:56,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:42:56,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:42:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:42:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:42:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:42:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:42:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:42:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:42:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:42:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:42:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:42:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:42:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:42:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:42:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:42:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:42:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:42:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:42:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:42:56,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:42:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387783724] [2024-10-14 13:42:56,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387783724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:42:56,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:42:56,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:42:56,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379662196] [2024-10-14 13:42:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:42:56,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:42:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:42:56,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:42:56,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:42:56,538 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:42:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:42:56,583 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2024-10-14 13:42:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:42:56,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-10-14 13:42:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:42:56,592 INFO L225 Difference]: With dead ends: 275 [2024-10-14 13:42:56,592 INFO L226 Difference]: Without dead ends: 139 [2024-10-14 13:42:56,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-14 13:42:56,596 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:42:56,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:42:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-14 13:42:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-14 13:42:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:42:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2024-10-14 13:42:56,611 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 136 [2024-10-14 13:42:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:42:56,612 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2024-10-14 13:42:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:42:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2024-10-14 13:42:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:42:56,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:42:56,615 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:42:56,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:42:56,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:42:56,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:42:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1711398442, now seen corresponding path program 1 times [2024-10-14 13:42:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:42:56,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560511325] [2024-10-14 13:42:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:42:56,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:42:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:42:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:42:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:42:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:42:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:42:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:42:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:42:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:42:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:42:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:42:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:42:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:42:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:42:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:42:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:42:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:42:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:42:57,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:42:57,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560511325] [2024-10-14 13:42:57,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560511325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:42:57,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:42:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:42:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951241949] [2024-10-14 13:42:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:42:57,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:42:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:42:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:42:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:42:57,278 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:42:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:42:57,368 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2024-10-14 13:42:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:42:57,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-14 13:42:57,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:42:57,373 INFO L225 Difference]: With dead ends: 280 [2024-10-14 13:42:57,373 INFO L226 Difference]: Without dead ends: 142 [2024-10-14 13:42:57,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-14 13:42:57,379 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 89 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:42:57,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 661 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:42:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-14 13:42:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-10-14 13:42:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:42:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-10-14 13:42:57,394 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 138 [2024-10-14 13:42:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:42:57,396 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-10-14 13:42:57,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:42:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-10-14 13:42:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:42:57,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:42:57,398 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:42:57,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:42:57,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:42:57,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:42:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 902051816, now seen corresponding path program 1 times [2024-10-14 13:42:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:42:57,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394454525] [2024-10-14 13:42:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:42:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:42:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:42:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:42:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:42:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:42:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:42:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:42:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:42:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:42:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:42:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:42:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:42:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:42:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:42:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:42:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:42:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:42:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:42:58,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:42:58,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394454525] [2024-10-14 13:42:58,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394454525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:42:58,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:42:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:42:58,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246049510] [2024-10-14 13:42:58,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:42:58,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:42:58,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:42:58,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:42:58,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:42:58,381 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:42:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:42:58,789 INFO L93 Difference]: Finished difference Result 564 states and 833 transitions. [2024-10-14 13:42:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:42:58,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-14 13:42:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:42:58,794 INFO L225 Difference]: With dead ends: 564 [2024-10-14 13:42:58,794 INFO L226 Difference]: Without dead ends: 424 [2024-10-14 13:42:58,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:42:58,796 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 446 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:42:58,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1787 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:42:58,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-14 13:42:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 418. [2024-10-14 13:42:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 366 states have (on average 1.4289617486338797) internal successors, (523), 366 states have internal predecessors, (523), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 13:42:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2024-10-14 13:42:58,855 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 138 [2024-10-14 13:42:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:42:58,855 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2024-10-14 13:42:58,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:42:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2024-10-14 13:42:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:42:58,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:42:58,861 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:42:58,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:42:58,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:42:58,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:42:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash 104536424, now seen corresponding path program 1 times [2024-10-14 13:42:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:42:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949323597] [2024-10-14 13:42:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:42:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:42:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:42:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:42:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:42:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:42:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:42:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:42:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:42:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:42:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:42:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:42:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:42:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:42:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:42:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:42:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:42:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:42:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:42:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:42:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:42:59,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949323597] [2024-10-14 13:42:59,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949323597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:42:59,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:42:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:42:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627248419] [2024-10-14 13:42:59,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:42:59,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:42:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:42:59,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:42:59,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:42:59,272 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:42:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:42:59,351 INFO L93 Difference]: Finished difference Result 1020 states and 1508 transitions. [2024-10-14 13:42:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:42:59,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-14 13:42:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:42:59,357 INFO L225 Difference]: With dead ends: 1020 [2024-10-14 13:42:59,357 INFO L226 Difference]: Without dead ends: 603 [2024-10-14 13:42:59,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-14 13:42:59,360 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 82 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:42:59,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 764 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:42:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-14 13:42:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 481. [2024-10-14 13:42:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 429 states have (on average 1.442890442890443) internal successors, (619), 429 states have internal predecessors, (619), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 13:42:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 715 transitions. [2024-10-14 13:42:59,400 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 715 transitions. Word has length 138 [2024-10-14 13:42:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:42:59,401 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 715 transitions. [2024-10-14 13:42:59,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:42:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 715 transitions. [2024-10-14 13:42:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 13:42:59,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:42:59,404 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:42:59,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:42:59,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:42:59,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:42:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1942662923, now seen corresponding path program 1 times [2024-10-14 13:42:59,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:42:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897213676] [2024-10-14 13:42:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:42:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:42:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:43:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:43:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:43:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:43:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:43:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:43:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:43:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:43:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:43:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:43:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:43:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:43:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:43:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:43:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:43:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:43:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:43:00,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:43:00,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897213676] [2024-10-14 13:43:00,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897213676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:00,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:00,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:43:00,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201308728] [2024-10-14 13:43:00,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:00,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:43:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:43:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:43:00,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:43:00,158 INFO L87 Difference]: Start difference. First operand 481 states and 715 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:00,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:00,278 INFO L93 Difference]: Finished difference Result 806 states and 1197 transitions. [2024-10-14 13:43:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:43:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-10-14 13:43:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:00,285 INFO L225 Difference]: With dead ends: 806 [2024-10-14 13:43:00,285 INFO L226 Difference]: Without dead ends: 645 [2024-10-14 13:43:00,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:43:00,287 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 195 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:00,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1458 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:43:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-14 13:43:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 324. [2024-10-14 13:43:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 289 states have (on average 1.4429065743944636) internal successors, (417), 289 states have internal predecessors, (417), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 13:43:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 481 transitions. [2024-10-14 13:43:00,314 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 481 transitions. Word has length 139 [2024-10-14 13:43:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:00,315 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 481 transitions. [2024-10-14 13:43:00,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 481 transitions. [2024-10-14 13:43:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 13:43:00,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:00,318 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:00,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:43:00,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:00,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash -651483506, now seen corresponding path program 1 times [2024-10-14 13:43:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:43:00,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395386999] [2024-10-14 13:43:00,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:43:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:43:00,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:43:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:43:00,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:43:00,595 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:43:00,596 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:43:00,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:43:00,600 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:43:00,806 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:43:00,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:43:00 BoogieIcfgContainer [2024-10-14 13:43:00,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:43:00,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:43:00,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:43:00,810 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:43:00,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:42:54" (3/4) ... [2024-10-14 13:43:00,812 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:43:00,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:43:00,814 INFO L158 Benchmark]: Toolchain (without parser) took 7791.57ms. Allocated memory was 180.4MB in the beginning and 297.8MB in the end (delta: 117.4MB). Free memory was 112.5MB in the beginning and 168.5MB in the end (delta: -56.1MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-10-14 13:43:00,814 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:43:00,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.89ms. Allocated memory is still 180.4MB. Free memory was 112.3MB in the beginning and 152.5MB in the end (delta: -40.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-10-14 13:43:00,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.52ms. Allocated memory is still 180.4MB. Free memory was 152.5MB in the beginning and 148.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:43:00,815 INFO L158 Benchmark]: Boogie Preprocessor took 128.98ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 142.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 13:43:00,816 INFO L158 Benchmark]: RCFGBuilder took 1021.79ms. Allocated memory is still 180.4MB. Free memory was 142.0MB in the beginning and 84.0MB in the end (delta: 58.0MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-14 13:43:00,816 INFO L158 Benchmark]: TraceAbstraction took 6157.35ms. Allocated memory was 180.4MB in the beginning and 297.8MB in the end (delta: 117.4MB). Free memory was 83.3MB in the beginning and 169.6MB in the end (delta: -86.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-10-14 13:43:00,816 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 297.8MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:43:00,818 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.17ms. Allocated memory is still 104.9MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.89ms. Allocated memory is still 180.4MB. Free memory was 112.3MB in the beginning and 152.5MB in the end (delta: -40.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.52ms. Allocated memory is still 180.4MB. Free memory was 152.5MB in the beginning and 148.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 128.98ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 142.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1021.79ms. Allocated memory is still 180.4MB. Free memory was 142.0MB in the beginning and 84.0MB in the end (delta: 58.0MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6157.35ms. Allocated memory was 180.4MB in the beginning and 297.8MB in the end (delta: 117.4MB). Free memory was 83.3MB in the beginning and 169.6MB in the end (delta: -86.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 297.8MB. Free memory is still 168.5MB. 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 someBinaryDOUBLEComparisonOperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10000000.8; [L22] double var_1_1 = 10000000.8; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] double var_1_3 = 16.2; [L26] double var_1_3 = 16.2; [L27] double* var_1_3_Pointer = &(var_1_3); [L28] double var_1_4 = 7.5; [L28] double var_1_4 = 7.5; [L29] double* var_1_4_Pointer = &(var_1_4); [L30] double var_1_5 = 49.6; [L30] double var_1_5 = 49.6; [L31] double* var_1_5_Pointer = &(var_1_5); [L32] signed short int var_1_6 = -10; [L32] signed short int var_1_6 = -10; [L33] signed short int* var_1_6_Pointer = &(var_1_6); [L34] double var_1_7 = 4.5; [L34] double var_1_7 = 4.5; [L35] double* var_1_7_Pointer = &(var_1_7); [L36] double var_1_8 = 9.4; [L36] double var_1_8 = 9.4; [L37] double* var_1_8_Pointer = &(var_1_8); [L38] signed short int var_1_9 = 128; [L38] signed short int var_1_9 = 128; [L39] signed short int* var_1_9_Pointer = &(var_1_9); [L40] signed short int var_1_10 = 128; [L40] signed short int var_1_10 = 128; [L41] signed short int* var_1_10_Pointer = &(var_1_10); [L42] unsigned char var_1_11 = 0; [L42] unsigned char var_1_11 = 0; [L43] unsigned char* var_1_11_Pointer = &(var_1_11); [L44] unsigned long int var_1_12 = 100; [L44] unsigned long int var_1_12 = 100; [L45] unsigned long int* var_1_12_Pointer = &(var_1_12); [L46] float var_1_13 = 128.4; [L46] float var_1_13 = 128.4; [L47] float* var_1_13_Pointer = &(var_1_13); [L48] double var_1_14 = 3.5; [L48] double var_1_14 = 3.5; [L49] double* var_1_14_Pointer = &(var_1_14); [L50] unsigned char var_1_15 = 16; [L50] unsigned char var_1_15 = 16; [L51] unsigned char* var_1_15_Pointer = &(var_1_15); [L52] unsigned char var_1_16 = 2; [L52] unsigned char var_1_16 = 2; [L53] unsigned char* var_1_16_Pointer = &(var_1_16); [L54] unsigned char last_1_var_1_15 = 16; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] EXPR \read(var_1_15) [L116] last_1_var_1_15 = var_1_15 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] var_1_3 = __VERIFIER_nondet_double() [L91] EXPR \read(var_1_3) [L91] EXPR var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] EXPR var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F [L91] EXPR \read(var_1_3) [L91] EXPR var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] EXPR (var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] EXPR (var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] var_1_4 = __VERIFIER_nondet_double() [L93] EXPR \read(var_1_4) [L93] EXPR var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F [L93] EXPR \read(var_1_4) [L93] EXPR var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR (var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR (var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L94] var_1_5 = __VERIFIER_nondet_double() [L95] EXPR \read(var_1_5) [L95] EXPR var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] EXPR var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F [L95] EXPR \read(var_1_5) [L95] EXPR var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] EXPR (var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] EXPR (var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] var_1_7 = __VERIFIER_nondet_double() [L97] EXPR \read(var_1_7) [L97] EXPR var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] EXPR var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F [L97] EXPR \read(var_1_7) [L97] EXPR var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] EXPR (var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] EXPR (var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] var_1_8 = __VERIFIER_nondet_double() [L99] EXPR \read(var_1_8) [L99] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F [L99] EXPR \read(var_1_8) [L99] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] EXPR (var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] EXPR (var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L100] var_1_9 = __VERIFIER_nondet_short() [L101] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] var_1_10 = __VERIFIER_nondet_short() [L104] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] var_1_14 = __VERIFIER_nondet_double() [L110] EXPR \read(var_1_14) [L110] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L110] EXPR \read(var_1_14) [L110] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L111] var_1_16 = __VERIFIER_nondet_uchar() [L112] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L113] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L113] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L113] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L127] RET updateVariables() [L128] CALL step() [L58] (*(var_1_12_Pointer)) = last_1_var_1_15 [L59] EXPR \read(*var_1_12_Pointer) [L59] unsigned long int stepLocal_1 = (*(var_1_12_Pointer)); [L60] EXPR \read(*var_1_9_Pointer) [L60] signed short int stepLocal_0 = (*(var_1_9_Pointer)); [L61] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L61] COND FALSE !(stepLocal_0 >= (*(var_1_10_Pointer))) [L68] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L68] COND FALSE !((*(var_1_2_Pointer))) [L71] EXPR \read(*var_1_7_Pointer) [L71] EXPR \read(*var_1_8_Pointer) [L71] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L71] COND FALSE !((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) [L74] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L74] COND FALSE !((*(var_1_2_Pointer))) [L79] EXPR \read(*var_1_15_Pointer) [L79] (*(var_1_6_Pointer)) = (*(var_1_15_Pointer)) [L82] EXPR \read(*var_1_7_Pointer) [L82] EXPR \read(*var_1_8_Pointer) [L82] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L82] COND FALSE !((*(var_1_7_Pointer)) < ((*(var_1_8_Pointer)) - (*(var_1_14_Pointer)))) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1 [L119] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1 VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))))) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))))) [L119] EXPR \read(*var_1_7_Pointer) [L119] EXPR \read(*var_1_8_Pointer) [L119] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR ((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer))))) [L119] EXPR \read(*var_1_6_Pointer) [L119] EXPR \read(*var_1_15_Pointer) [L119] EXPR \read(*var_1_15_Pointer) [L119] EXPR ((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))))) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer))))))) && ((*(var_1_12_Pointer)) == ((unsigned long int) last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer))))))) && ((*(var_1_12_Pointer)) == ((unsigned long int) last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer))))))) && ((*(var_1_12_Pointer)) == ((unsigned long int) last_1_var_1_15))) && (((*(var_1_7_Pointer)) < ((*(var_1_8_Pointer)) - (*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer)) == ((float) (((((*(var_1_4_Pointer))) > (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_4_Pointer))) : (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer)))))))))) : 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer))))))) && ((*(var_1_12_Pointer)) == ((unsigned long int) last_1_var_1_15))) && (((*(var_1_7_Pointer)) < ((*(var_1_8_Pointer)) - (*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer)) == ((float) (((((*(var_1_4_Pointer))) > (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_4_Pointer))) : (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer)))))))))) : 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer))))))) && ((*(var_1_12_Pointer)) == ((unsigned long int) last_1_var_1_15))) && (((*(var_1_7_Pointer)) < ((*(var_1_8_Pointer)) - (*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer)) == ((float) (((((*(var_1_4_Pointer))) > (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_4_Pointer))) : (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer)))))))))) : 1)) && (((*(var_1_9_Pointer)) >= (*(var_1_10_Pointer))) ? ((((*(var_1_9_Pointer)) + last_1_var_1_15) >= (*(var_1_12_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer))))))) && ((*(var_1_12_Pointer)) == ((unsigned long int) last_1_var_1_15))) && (((*(var_1_7_Pointer)) < ((*(var_1_8_Pointer)) - (*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer)) == ((float) (((((*(var_1_4_Pointer))) > (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_4_Pointer))) : (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer)))))))))) : 1)) && (((*(var_1_9_Pointer)) >= (*(var_1_10_Pointer))) ? ((((*(var_1_9_Pointer)) + last_1_var_1_15) >= (*(var_1_12_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119-L120] return (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((double) ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((49.5 + (*(var_1_5_Pointer))))) ? ((*(var_1_4_Pointer))) : ((49.5 + (*(var_1_5_Pointer))))))))) : 1) && (((- ((*(var_1_7_Pointer)) - (*(var_1_8_Pointer)))) <= (*(var_1_3_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed short int) ((8 + (*(var_1_15_Pointer))) - (*(var_1_15_Pointer))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_11_Pointer)) ? ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer)))) : 1) : ((*(var_1_6_Pointer)) == ((signed short int) (*(var_1_15_Pointer))))))) && ((*(var_1_12_Pointer)) == ((unsigned long int) last_1_var_1_15))) && (((*(var_1_7_Pointer)) < ((*(var_1_8_Pointer)) - (*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer)) == ((float) (((((*(var_1_4_Pointer))) > (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer))))))) ? ((*(var_1_4_Pointer))) : (((((((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) > ((*(var_1_3_Pointer)))) ? (((((127.4f) > ((*(var_1_5_Pointer)))) ? (127.4f) : ((*(var_1_5_Pointer)))))) : ((*(var_1_3_Pointer)))))))))) : 1)) && (((*(var_1_9_Pointer)) >= (*(var_1_10_Pointer))) ? ((((*(var_1_9_Pointer)) + last_1_var_1_15) >= (*(var_1_12_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) : 1) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=16, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19: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_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 812 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 812 mSDsluCounter, 6030 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4443 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 1587 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=481occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 450 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1100 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 1720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 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-14 13:43:00,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8118e579ef4e3ad5faaa9b6d928fc4dda4bd859822f258d10da0e3bf596f403 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:43:03,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:43:03,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:43:03,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:43:03,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:43:03,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:43:03,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:43:03,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:43:03,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:43:03,147 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:43:03,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:43:03,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:43:03,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:43:03,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:43:03,149 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:43:03,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:43:03,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:43:03,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:43:03,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:43:03,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:43:03,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:43:03,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:43:03,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:43:03,152 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:43:03,153 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:43:03,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:43:03,153 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:43:03,153 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:43:03,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:43:03,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:43:03,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:43:03,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:43:03,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:43:03,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:43:03,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:43:03,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:43:03,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:43:03,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:43:03,166 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:43:03,166 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:43:03,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:43:03,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:43:03,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:43:03,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:43:03,168 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:43:03,168 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8118e579ef4e3ad5faaa9b6d928fc4dda4bd859822f258d10da0e3bf596f403 [2024-10-14 13:43:03,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:43:03,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:43:03,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:43:03,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:43:03,561 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:43:03,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-17.i [2024-10-14 13:43:05,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:43:05,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:43:05,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-17.i [2024-10-14 13:43:05,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8acaed260/410d39f106944ec6b8a6f23edb90d752/FLAGf3072b6ed [2024-10-14 13:43:05,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8acaed260/410d39f106944ec6b8a6f23edb90d752 [2024-10-14 13:43:05,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:43:05,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:43:05,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:43:05,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:43:05,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:43:05,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:05,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af1e343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05, skipping insertion in model container [2024-10-14 13:43:05,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:05,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:43:05,610 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-17.i[916,929] [2024-10-14 13:43:05,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:43:05,725 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:43:05,736 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-17.i[916,929] [2024-10-14 13:43:05,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:43:05,817 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:43:05,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05 WrapperNode [2024-10-14 13:43:05,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:43:05,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:43:05,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:43:05,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:43:05,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:05,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:05,902 INFO L138 Inliner]: procedures = 39, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 660 [2024-10-14 13:43:05,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:43:05,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:43:05,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:43:05,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:43:05,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:05,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:05,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:05,960 INFO L175 MemorySlicer]: Split 156 memory accesses to 17 slices as follows [2, 3, 8, 18, 14, 26, 7, 10, 10, 8, 6, 6, 5, 3, 8, 14, 8]. 17 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-10-14 13:43:05,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:05,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:05,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:06,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:06,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:06,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:06,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:43:06,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:43:06,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:43:06,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:43:06,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (1/1) ... [2024-10-14 13:43:06,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:43:06,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:43:06,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:43:06,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:43:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:43:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 13:43:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 13:43:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-14 13:43:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-14 13:43:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-14 13:43:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-14 13:43:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-14 13:43:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-14 13:43:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-14 13:43:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-14 13:43:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-14 13:43:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-10-14 13:43:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-10-14 13:43:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-10-14 13:43:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-10-14 13:43:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2024-10-14 13:43:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#16 [2024-10-14 13:43:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 13:43:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 13:43:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-14 13:43:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-14 13:43:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-14 13:43:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-14 13:43:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-14 13:43:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#16 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:43:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-14 13:43:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-14 13:43:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-14 13:43:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-14 13:43:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-14 13:43:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-14 13:43:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2024-10-14 13:43:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 13:43:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 13:43:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-14 13:43:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-14 13:43:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-14 13:43:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-14 13:43:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-14 13:43:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-14 13:43:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-14 13:43:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 13:43:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-14 13:43:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-14 13:43:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-14 13:43:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-14 13:43:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-14 13:43:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-14 13:43:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-14 13:43:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-14 13:43:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-14 13:43:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-14 13:43:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-14 13:43:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-14 13:43:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2024-10-14 13:43:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:43:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:43:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 13:43:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-14 13:43:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-14 13:43:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-14 13:43:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-14 13:43:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-14 13:43:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-14 13:43:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-14 13:43:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-14 13:43:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-14 13:43:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-10-14 13:43:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-10-14 13:43:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-10-14 13:43:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-10-14 13:43:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2024-10-14 13:43:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 13:43:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 13:43:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 13:43:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 13:43:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-14 13:43:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-14 13:43:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-14 13:43:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-14 13:43:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-14 13:43:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-14 13:43:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#16 [2024-10-14 13:43:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-14 13:43:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-10-14 13:43:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-10-14 13:43:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-10-14 13:43:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-10-14 13:43:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2024-10-14 13:43:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 13:43:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 13:43:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-14 13:43:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-14 13:43:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-14 13:43:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-14 13:43:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-14 13:43:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-14 13:43:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-14 13:43:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-14 13:43:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-14 13:43:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-14 13:43:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-14 13:43:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-14 13:43:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-14 13:43:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-14 13:43:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2024-10-14 13:43:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 13:43:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 13:43:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 13:43:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 13:43:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-14 13:43:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-14 13:43:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-14 13:43:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-14 13:43:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-14 13:43:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-14 13:43:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-14 13:43:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-14 13:43:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-14 13:43:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-14 13:43:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-14 13:43:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-14 13:43:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2024-10-14 13:43:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 13:43:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 13:43:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-14 13:43:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-14 13:43:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-14 13:43:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-14 13:43:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-14 13:43:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-14 13:43:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-14 13:43:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-14 13:43:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-14 13:43:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-14 13:43:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-14 13:43:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-14 13:43:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-14 13:43:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-14 13:43:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2024-10-14 13:43:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:43:06,187 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:43:06,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-14 13:43:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-14 13:43:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-14 13:43:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-14 13:43:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-14 13:43:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-14 13:43:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-14 13:43:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2024-10-14 13:43:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 13:43:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 13:43:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-14 13:43:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-14 13:43:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-14 13:43:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-14 13:43:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-14 13:43:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 13:43:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-10-14 13:43:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2024-10-14 13:43:06,569 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:43:06,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:43:10,246 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-10-14 13:43:10,246 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:43:10,314 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:43:10,314 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:43:10,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:10 BoogieIcfgContainer [2024-10-14 13:43:10,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:43:10,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:43:10,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:43:10,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:43:10,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:43:05" (1/3) ... [2024-10-14 13:43:10,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4c587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:43:10, skipping insertion in model container [2024-10-14 13:43:10,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:05" (2/3) ... [2024-10-14 13:43:10,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4c587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:43:10, skipping insertion in model container [2024-10-14 13:43:10,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:10" (3/3) ... [2024-10-14 13:43:10,328 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-17.i [2024-10-14 13:43:10,344 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:43:10,345 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:43:10,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:43:10,429 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;@57f2bb88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:43:10,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:43:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:43:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 13:43:10,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:10,449 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:10,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:10,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1140966049, now seen corresponding path program 1 times [2024-10-14 13:43:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447431006] [2024-10-14 13:43:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:10,472 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-14 13:43:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:10,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:10,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 13:43:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:11,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:43:11,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-14 13:43:11,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:43:11,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:11,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447431006] [2024-10-14 13:43:11,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447431006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:11,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:11,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:43:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313616967] [2024-10-14 13:43:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:11,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:43:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:43:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:43:11,387 INFO L87 Difference]: Start difference. First operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:11,468 INFO L93 Difference]: Finished difference Result 271 states and 428 transitions. [2024-10-14 13:43:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:43:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-14 13:43:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:11,481 INFO L225 Difference]: With dead ends: 271 [2024-10-14 13:43:11,482 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 13:43:11,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-14 13:43:11,489 INFO L432 NwaCegarLoop]: 198 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, 198 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-14 13:43:11,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:43:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 13:43:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-14 13:43:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.452991452991453) internal successors, (170), 117 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:43:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-14 13:43:11,543 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 136 [2024-10-14 13:43:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:11,547 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-14 13:43:11,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-14 13:43:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 13:43:11,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:11,551 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:11,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 13:43:11,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:11,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:11,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1612411427, now seen corresponding path program 1 times [2024-10-14 13:43:11,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:11,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887678734] [2024-10-14 13:43:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:11,754 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-14 13:43:11,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:11,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:11,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 13:43:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:12,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:43:12,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-14 13:43:12,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:43:12,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:12,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887678734] [2024-10-14 13:43:12,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887678734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:12,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:12,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:43:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768983804] [2024-10-14 13:43:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:12,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:43:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:12,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:43:12,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:43:12,570 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:12,705 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2024-10-14 13:43:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:43:12,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-14 13:43:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:12,708 INFO L225 Difference]: With dead ends: 271 [2024-10-14 13:43:12,708 INFO L226 Difference]: Without dead ends: 137 [2024-10-14 13:43:12,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 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-14 13:43:12,710 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:12,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:43:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-14 13:43:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-14 13:43:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:43:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2024-10-14 13:43:12,736 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 136 [2024-10-14 13:43:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:12,738 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2024-10-14 13:43:12,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2024-10-14 13:43:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 13:43:12,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:12,740 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:12,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 13:43:12,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:12,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:12,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash -632146971, now seen corresponding path program 1 times [2024-10-14 13:43:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:12,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977435123] [2024-10-14 13:43:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:12,943 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-14 13:43:12,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:12,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:12,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 13:43:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:13,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:43:13,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:43:13,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:43:13,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:13,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977435123] [2024-10-14 13:43:13,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977435123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:13,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:43:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072036088] [2024-10-14 13:43:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:13,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:43:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:13,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:43:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:43:13,602 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:13,744 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2024-10-14 13:43:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:43:13,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-10-14 13:43:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:13,750 INFO L225 Difference]: With dead ends: 275 [2024-10-14 13:43:13,752 INFO L226 Difference]: Without dead ends: 139 [2024-10-14 13:43:13,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 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-14 13:43:13,754 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:13,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:43:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-14 13:43:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-14 13:43:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:43:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2024-10-14 13:43:13,765 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 136 [2024-10-14 13:43:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:13,766 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2024-10-14 13:43:13,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2024-10-14 13:43:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:43:13,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:13,769 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:13,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 13:43:13,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:13,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1711398442, now seen corresponding path program 1 times [2024-10-14 13:43:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:13,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875500814] [2024-10-14 13:43:13,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:13,971 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-14 13:43:13,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:13,975 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:13,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 13:43:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:14,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 13:43:14,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:14,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 13:43:15,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-14 13:43:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:43:15,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:43:15,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:15,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875500814] [2024-10-14 13:43:15,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875500814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:15,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:15,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:43:15,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373174786] [2024-10-14 13:43:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:15,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:43:15,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:15,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:43:15,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:43:15,286 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:16,332 INFO L93 Difference]: Finished difference Result 556 states and 824 transitions. [2024-10-14 13:43:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:43:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-14 13:43:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:16,336 INFO L225 Difference]: With dead ends: 556 [2024-10-14 13:43:16,338 INFO L226 Difference]: Without dead ends: 418 [2024-10-14 13:43:16,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:43:16,341 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 615 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:16,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1282 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 13:43:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-14 13:43:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 318. [2024-10-14 13:43:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 283 states have (on average 1.4452296819787986) internal successors, (409), 283 states have internal predecessors, (409), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 13:43:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 473 transitions. [2024-10-14 13:43:16,381 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 473 transitions. Word has length 138 [2024-10-14 13:43:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:16,381 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 473 transitions. [2024-10-14 13:43:16,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 473 transitions. [2024-10-14 13:43:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:43:16,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:16,385 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:16,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 13:43:16,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:16,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:16,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:16,586 INFO L85 PathProgramCache]: Analyzing trace with hash 902051816, now seen corresponding path program 1 times [2024-10-14 13:43:16,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:16,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015693291] [2024-10-14 13:43:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:16,587 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-14 13:43:16,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:16,590 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:16,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 13:43:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:17,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 13:43:17,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:17,609 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 29 treesize of output 25 [2024-10-14 13:43:17,704 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 98 treesize of output 70 [2024-10-14 13:43:17,712 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 72 treesize of output 60 [2024-10-14 13:43:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:43:17,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:43:17,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:17,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015693291] [2024-10-14 13:43:17,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015693291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:17,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:43:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059688124] [2024-10-14 13:43:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:17,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:43:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:17,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:43:17,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:43:17,748 INFO L87 Difference]: Start difference. First operand 318 states and 473 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:18,690 INFO L93 Difference]: Finished difference Result 780 states and 1157 transitions. [2024-10-14 13:43:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:43:18,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-14 13:43:18,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:18,694 INFO L225 Difference]: With dead ends: 780 [2024-10-14 13:43:18,695 INFO L226 Difference]: Without dead ends: 463 [2024-10-14 13:43:18,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:43:18,699 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 397 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:18,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1515 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 13:43:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-14 13:43:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 458. [2024-10-14 13:43:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 406 states have (on average 1.438423645320197) internal successors, (584), 406 states have internal predecessors, (584), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 13:43:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 680 transitions. [2024-10-14 13:43:18,755 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 680 transitions. Word has length 138 [2024-10-14 13:43:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:18,755 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 680 transitions. [2024-10-14 13:43:18,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 680 transitions. [2024-10-14 13:43:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:43:18,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:18,758 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:18,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 13:43:18,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:18,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:18,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash 104536424, now seen corresponding path program 1 times [2024-10-14 13:43:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:18,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668852783] [2024-10-14 13:43:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:18,960 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-14 13:43:18,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:18,963 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:18,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 13:43:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:19,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 13:43:19,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 14 proven. 102 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 13:43:20,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:43:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:43:20,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668852783] [2024-10-14 13:43:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668852783] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:43:20,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:43:20,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-14 13:43:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58133131] [2024-10-14 13:43:20,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:20,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:43:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:20,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:43:20,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:43:20,317 INFO L87 Difference]: Start difference. First operand 458 states and 680 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:20,744 INFO L93 Difference]: Finished difference Result 1131 states and 1677 transitions. [2024-10-14 13:43:20,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:43:20,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-14 13:43:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:20,751 INFO L225 Difference]: With dead ends: 1131 [2024-10-14 13:43:20,752 INFO L226 Difference]: Without dead ends: 674 [2024-10-14 13:43:20,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:43:20,755 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 82 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:20,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 765 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:43:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-10-14 13:43:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 542. [2024-10-14 13:43:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 490 states have (on average 1.453061224489796) internal successors, (712), 490 states have internal predecessors, (712), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 13:43:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 808 transitions. [2024-10-14 13:43:20,801 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 808 transitions. Word has length 138 [2024-10-14 13:43:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:20,801 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 808 transitions. [2024-10-14 13:43:20,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 808 transitions. [2024-10-14 13:43:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 13:43:20,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:20,804 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:20,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 13:43:21,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:21,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:21,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1942662923, now seen corresponding path program 1 times [2024-10-14 13:43:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:21,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940808265] [2024-10-14 13:43:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:21,006 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-14 13:43:21,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:21,007 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:21,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 13:43:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:21,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:43:21,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:21,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:43:21,826 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 155 treesize of output 65 [2024-10-14 13:43:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-14 13:43:21,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:43:21,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:21,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940808265] [2024-10-14 13:43:21,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940808265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:21,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:21,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:43:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387984315] [2024-10-14 13:43:21,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:21,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:43:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:43:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:43:21,874 INFO L87 Difference]: Start difference. First operand 542 states and 808 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:25,251 INFO L93 Difference]: Finished difference Result 1086 states and 1618 transitions. [2024-10-14 13:43:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:43:25,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-10-14 13:43:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:25,255 INFO L225 Difference]: With dead ends: 1086 [2024-10-14 13:43:25,255 INFO L226 Difference]: Without dead ends: 545 [2024-10-14 13:43:25,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:43:25,257 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 172 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:25,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 519 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 13:43:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-14 13:43:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 542. [2024-10-14 13:43:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 490 states have (on average 1.4469387755102041) internal successors, (709), 490 states have internal predecessors, (709), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 13:43:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 805 transitions. [2024-10-14 13:43:25,289 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 805 transitions. Word has length 139 [2024-10-14 13:43:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:25,290 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 805 transitions. [2024-10-14 13:43:25,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 805 transitions. [2024-10-14 13:43:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 13:43:25,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:25,292 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:25,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-14 13:43:25,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:25,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -744266939, now seen corresponding path program 1 times [2024-10-14 13:43:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:25,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760206977] [2024-10-14 13:43:25,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:25,495 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-14 13:43:25,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:25,497 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:25,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 13:43:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:26,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:43:26,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:26,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:43:26,301 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 155 treesize of output 65 [2024-10-14 13:43:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-10-14 13:43:26,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:43:26,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:26,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760206977] [2024-10-14 13:43:26,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760206977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:26,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:26,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:43:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392613520] [2024-10-14 13:43:26,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:26,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:43:26,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:26,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:43:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:43:26,330 INFO L87 Difference]: Start difference. First operand 542 states and 805 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:29,274 INFO L93 Difference]: Finished difference Result 1086 states and 1612 transitions. [2024-10-14 13:43:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:43:29,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-10-14 13:43:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:29,279 INFO L225 Difference]: With dead ends: 1086 [2024-10-14 13:43:29,280 INFO L226 Difference]: Without dead ends: 545 [2024-10-14 13:43:29,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:43:29,282 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 164 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:29,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 512 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 13:43:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-14 13:43:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 542. [2024-10-14 13:43:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 490 states have (on average 1.4408163265306122) internal successors, (706), 490 states have internal predecessors, (706), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 13:43:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 802 transitions. [2024-10-14 13:43:29,307 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 802 transitions. Word has length 141 [2024-10-14 13:43:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:29,308 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 802 transitions. [2024-10-14 13:43:29,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 802 transitions. [2024-10-14 13:43:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 13:43:29,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:29,310 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:29,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 13:43:29,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:29,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:29,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1817922763, now seen corresponding path program 1 times [2024-10-14 13:43:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:29,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960718469] [2024-10-14 13:43:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:29,512 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-14 13:43:29,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:29,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:29,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 13:43:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:30,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:43:30,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:30,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:43:30,482 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 155 treesize of output 65 [2024-10-14 13:43:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-14 13:43:30,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:43:30,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:30,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960718469] [2024-10-14 13:43:30,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960718469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:30,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:30,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:43:30,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145196915] [2024-10-14 13:43:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:30,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:43:30,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:30,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:43:30,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:43:30,507 INFO L87 Difference]: Start difference. First operand 542 states and 802 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:34,249 INFO L93 Difference]: Finished difference Result 1086 states and 1606 transitions. [2024-10-14 13:43:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:43:34,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-10-14 13:43:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:34,254 INFO L225 Difference]: With dead ends: 1086 [2024-10-14 13:43:34,254 INFO L226 Difference]: Without dead ends: 545 [2024-10-14 13:43:34,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:43:34,256 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 137 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:34,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 510 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 13:43:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-14 13:43:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 542. [2024-10-14 13:43:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 490 states have (on average 1.4346938775510205) internal successors, (703), 490 states have internal predecessors, (703), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 13:43:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 799 transitions. [2024-10-14 13:43:34,278 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 799 transitions. Word has length 143 [2024-10-14 13:43:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:34,279 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 799 transitions. [2024-10-14 13:43:34,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:43:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 799 transitions. [2024-10-14 13:43:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 13:43:34,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:34,281 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:34,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-14 13:43:34,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:34,482 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:34,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:34,482 INFO L85 PathProgramCache]: Analyzing trace with hash 848582405, now seen corresponding path program 1 times [2024-10-14 13:43:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:34,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386202150] [2024-10-14 13:43:34,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:34,483 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-14 13:43:34,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:34,487 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:34,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 13:43:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:43:35,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 13:43:35,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:43:35,254 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 29 treesize of output 25 [2024-10-14 13:43:35,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 66 [2024-10-14 13:43:35,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2024-10-14 13:43:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:43:35,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:43:35,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:43:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386202150] [2024-10-14 13:43:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386202150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:43:35,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:43:35,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:43:35,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838083763] [2024-10-14 13:43:35,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:43:35,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:43:35,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:43:35,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:43:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:43:35,350 INFO L87 Difference]: Start difference. First operand 542 states and 799 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:35,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:43:35,964 INFO L93 Difference]: Finished difference Result 929 states and 1370 transitions. [2024-10-14 13:43:35,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:43:35,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 145 [2024-10-14 13:43:35,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:43:35,968 INFO L225 Difference]: With dead ends: 929 [2024-10-14 13:43:35,968 INFO L226 Difference]: Without dead ends: 770 [2024-10-14 13:43:35,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:43:35,970 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 190 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:43:35,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1411 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:43:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-14 13:43:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 768. [2024-10-14 13:43:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 699 states have (on average 1.4377682403433476) internal successors, (1005), 699 states have internal predecessors, (1005), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 13:43:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1133 transitions. [2024-10-14 13:43:36,000 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1133 transitions. Word has length 145 [2024-10-14 13:43:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:43:36,000 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1133 transitions. [2024-10-14 13:43:36,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:43:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1133 transitions. [2024-10-14 13:43:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 13:43:36,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:43:36,002 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:43:36,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 13:43:36,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:43:36,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:43:36,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:43:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1745564024, now seen corresponding path program 1 times [2024-10-14 13:43:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:43:36,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101725296] [2024-10-14 13:43:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:43:36,204 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-14 13:43:36,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:43:36,205 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:43:36,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process