./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-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-45.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b13a6a0e7fa67fd32bc4fd2162910d883ff12a5ba2116a1664f768b36904ccd2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:38:19,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:38:19,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:38:19,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:38:19,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:38:19,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:38:19,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:38:19,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:38:19,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:38:19,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:38:19,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:38:19,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:38:19,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:38:19,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:38:19,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:38:19,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:38:19,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:38:19,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:38:19,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:38:19,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:38:19,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:38:19,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:38:19,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:38:19,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:38:19,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:38:19,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:38:19,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:38:19,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:38:19,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:38:19,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:38:19,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:38:19,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:38:19,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:38:19,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:38:19,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:38:19,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:38:19,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:38:19,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:38:19,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:38:19,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:38:19,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:38:19,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:38:19,600 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b13a6a0e7fa67fd32bc4fd2162910d883ff12a5ba2116a1664f768b36904ccd2 [2024-10-11 13:38:19,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:38:19,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:38:19,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:38:19,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:38:19,896 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:38:19,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-45.i [2024-10-11 13:38:21,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:38:21,462 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:38:21,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-45.i [2024-10-11 13:38:21,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7eee067e4/8fc766c4a4cd4cf09fca6762bc96ee1d/FLAG26afd454e [2024-10-11 13:38:21,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7eee067e4/8fc766c4a4cd4cf09fca6762bc96ee1d [2024-10-11 13:38:21,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:38:21,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:38:21,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:38:21,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:38:21,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:38:21,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:38:21" (1/1) ... [2024-10-11 13:38:21,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5871abdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:21, skipping insertion in model container [2024-10-11 13:38:21,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:38:21" (1/1) ... [2024-10-11 13:38:21,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:38:22,036 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-45.i[916,929] [2024-10-11 13:38:22,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:38:22,133 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:38:22,143 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-45.i[916,929] [2024-10-11 13:38:22,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:38:22,203 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:38:22,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22 WrapperNode [2024-10-11 13:38:22,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:38:22,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:38:22,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:38:22,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:38:22,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,258 INFO L138 Inliner]: procedures = 29, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 613 [2024-10-11 13:38:22,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:38:22,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:38:22,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:38:22,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:38:22,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,302 INFO L175 MemorySlicer]: Split 150 memory accesses to 19 slices as follows [2, 7, 6, 6, 12, 10, 16, 3, 6, 8, 7, 8, 6, 6, 6, 6, 22, 7, 6]. 15 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 20 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-11 13:38:22,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:38:22,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:38:22,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:38:22,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:38:22,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (1/1) ... [2024-10-11 13:38:22,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:38:22,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:38:22,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:38:22,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:38:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:38:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:38:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:38:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:38:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:38:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:38:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:38:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:38:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:38:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:38:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:38:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:38:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:38:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:38:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:38:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-11 13:38:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-11 13:38:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2024-10-11 13:38:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#17 [2024-10-11 13:38:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#18 [2024-10-11 13:38:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:38:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:38:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:38:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:38:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:38:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:38:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:38:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:38:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:38:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:38:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-11 13:38:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-11 13:38:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2024-10-11 13:38:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#17 [2024-10-11 13:38:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#18 [2024-10-11 13:38:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:38:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:38:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:38:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:38:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:38:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:38:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:38:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:38:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:38:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:38:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:38:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:38:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:38:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:38:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 13:38:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 13:38:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-11 13:38:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-11 13:38:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-11 13:38:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:38:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:38:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:38:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:38:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:38:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:38:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:38:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:38:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:38:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:38:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:38:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:38:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:38:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:38:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-11 13:38:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-11 13:38:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2024-10-11 13:38:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#17 [2024-10-11 13:38:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#18 [2024-10-11 13:38:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:38:22,454 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:38:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:38:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:38:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:38:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:38:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:38:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:38:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:38:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:38:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:38:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:38:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:38:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:38:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:38:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:38:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 13:38:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 13:38:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 13:38:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 13:38:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 13:38:22,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:38:22,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:38:22,639 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:38:22,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:38:23,205 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-10-11 13:38:23,205 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:38:23,247 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:38:23,248 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:38:23,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:38:23 BoogieIcfgContainer [2024-10-11 13:38:23,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:38:23,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:38:23,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:38:23,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:38:23,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:38:21" (1/3) ... [2024-10-11 13:38:23,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fdace5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:38:23, skipping insertion in model container [2024-10-11 13:38:23,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:22" (2/3) ... [2024-10-11 13:38:23,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fdace5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:38:23, skipping insertion in model container [2024-10-11 13:38:23,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:38:23" (3/3) ... [2024-10-11 13:38:23,259 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-45.i [2024-10-11 13:38:23,273 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:38:23,274 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:38:23,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:38:23,350 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;@7053a49d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:38:23,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:38:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 106 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:38:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 13:38:23,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:23,373 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:23,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:23,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1009589726, now seen corresponding path program 1 times [2024-10-11 13:38:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:38:23,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585832163] [2024-10-11 13:38:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:38:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:38:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:38:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:38:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:38:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:38:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:38:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:38:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:38:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:38:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:38:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:38:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:38:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:38:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:38:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:38:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:38:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:38:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:38:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:38:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:38:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:38:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:38:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:38:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:38:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:38:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:23,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:38:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585832163] [2024-10-11 13:38:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585832163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:23,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:23,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:38:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221311886] [2024-10-11 13:38:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:23,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:38:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:38:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:38:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:38:24,000 INFO L87 Difference]: Start difference. First operand has 133 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 106 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:38:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:24,046 INFO L93 Difference]: Finished difference Result 263 states and 421 transitions. [2024-10-11 13:38:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:38:24,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 184 [2024-10-11 13:38:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:24,055 INFO L225 Difference]: With dead ends: 263 [2024-10-11 13:38:24,056 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 13:38:24,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:38:24,062 INFO L432 NwaCegarLoop]: 190 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, 190 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:24,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:38:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 13:38:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-11 13:38:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:38:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 194 transitions. [2024-10-11 13:38:24,112 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 194 transitions. Word has length 184 [2024-10-11 13:38:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:24,113 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 194 transitions. [2024-10-11 13:38:24,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:38:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 194 transitions. [2024-10-11 13:38:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 13:38:24,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:24,120 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:24,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:38:24,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:24,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash 824130940, now seen corresponding path program 1 times [2024-10-11 13:38:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:38:24,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306453692] [2024-10-11 13:38:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:24,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:38:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:38:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:38:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:38:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:38:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:38:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:38:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:38:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:38:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:38:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:38:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:38:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:38:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:38:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:38:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:38:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:38:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:38:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:38:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:38:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:38:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:38:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:38:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:38:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:38:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:38:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:24,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:38:24,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306453692] [2024-10-11 13:38:24,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306453692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:24,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:24,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:38:24,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399547888] [2024-10-11 13:38:24,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:24,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:38:24,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:38:24,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:38:24,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:38:24,534 INFO L87 Difference]: Start difference. First operand 131 states and 194 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:38:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:24,587 INFO L93 Difference]: Finished difference Result 263 states and 390 transitions. [2024-10-11 13:38:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:38:24,588 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 184 [2024-10-11 13:38:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:24,590 INFO L225 Difference]: With dead ends: 263 [2024-10-11 13:38:24,590 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 13:38:24,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:38:24,592 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 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-11 13:38:24,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:38:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 13:38:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-11 13:38:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:38:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2024-10-11 13:38:24,604 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 184 [2024-10-11 13:38:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:24,609 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2024-10-11 13:38:24,609 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:38:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2024-10-11 13:38:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 13:38:24,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:24,615 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:24,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:38:24,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:24,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash 413520574, now seen corresponding path program 1 times [2024-10-11 13:38:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:38:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588303075] [2024-10-11 13:38:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:24,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:38:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:38:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:38:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:38:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:38:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:38:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:38:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:38:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:38:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:38:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:38:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:38:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:38:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:38:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:38:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:38:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:38:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:38:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:38:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:38:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:38:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:38:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:38:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:38:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:38:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:38:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:25,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:38:25,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588303075] [2024-10-11 13:38:25,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588303075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:25,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:25,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:38:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842273878] [2024-10-11 13:38:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:25,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:38:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:38:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:38:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:38:25,091 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:25,186 INFO L93 Difference]: Finished difference Result 397 states and 586 transitions. [2024-10-11 13:38:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:38:25,186 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), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 184 [2024-10-11 13:38:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:25,191 INFO L225 Difference]: With dead ends: 397 [2024-10-11 13:38:25,191 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 13:38:25,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:38:25,197 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 121 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:25,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 548 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:38:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 13:38:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 252. [2024-10-11 13:38:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 199 states have (on average 1.3668341708542713) internal successors, (272), 199 states have internal predecessors, (272), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:38:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2024-10-11 13:38:25,221 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 184 [2024-10-11 13:38:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:25,222 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2024-10-11 13:38:25,222 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), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2024-10-11 13:38:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 13:38:25,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:25,225 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:25,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:38:25,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:25,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash 782057305, now seen corresponding path program 1 times [2024-10-11 13:38:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:38:25,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545679278] [2024-10-11 13:38:25,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:38:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:38:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:38:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:38:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:38:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:38:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:38:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:38:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:38:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:38:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:38:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:38:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:38:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:38:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:38:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:38:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:38:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:38:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:38:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:38:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:38:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:38:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:38:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:38:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:38:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:38:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:38:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545679278] [2024-10-11 13:38:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545679278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:25,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:25,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:38:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808525312] [2024-10-11 13:38:25,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:25,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:38:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:38:25,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:38:25,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:38:25,878 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:25,980 INFO L93 Difference]: Finished difference Result 754 states and 1114 transitions. [2024-10-11 13:38:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:38:25,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2024-10-11 13:38:25,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:25,984 INFO L225 Difference]: With dead ends: 754 [2024-10-11 13:38:25,984 INFO L226 Difference]: Without dead ends: 503 [2024-10-11 13:38:25,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:38:25,986 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 191 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:25,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 719 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:38:25,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-10-11 13:38:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2024-10-11 13:38:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 396 states have (on average 1.3636363636363635) internal successors, (540), 396 states have internal predecessors, (540), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 13:38:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 740 transitions. [2024-10-11 13:38:26,028 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 740 transitions. Word has length 186 [2024-10-11 13:38:26,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:26,029 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 740 transitions. [2024-10-11 13:38:26,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 740 transitions. [2024-10-11 13:38:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 13:38:26,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:26,031 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:26,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:38:26,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:26,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:26,032 INFO L85 PathProgramCache]: Analyzing trace with hash -35591145, now seen corresponding path program 1 times [2024-10-11 13:38:26,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:38:26,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373535245] [2024-10-11 13:38:26,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:26,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:38:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:38:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:38:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:38:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:38:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:38:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:38:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:38:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:38:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:38:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:38:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:38:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:38:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:38:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:38:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:38:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:38:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:38:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:38:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:38:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:38:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:38:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:38:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:38:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:38:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:38:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:38:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373535245] [2024-10-11 13:38:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373535245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:38:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984843415] [2024-10-11 13:38:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:38:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:38:26,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:38:26,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:38:26,723 INFO L87 Difference]: Start difference. First operand 501 states and 740 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:26,951 INFO L93 Difference]: Finished difference Result 1003 states and 1480 transitions. [2024-10-11 13:38:26,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:38:26,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2024-10-11 13:38:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:26,957 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 13:38:26,958 INFO L226 Difference]: Without dead ends: 503 [2024-10-11 13:38:26,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:38:26,962 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 282 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:26,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 667 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:38:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-10-11 13:38:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2024-10-11 13:38:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 396 states have (on average 1.3585858585858586) internal successors, (538), 396 states have internal predecessors, (538), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 13:38:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 738 transitions. [2024-10-11 13:38:27,005 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 738 transitions. Word has length 186 [2024-10-11 13:38:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:27,006 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 738 transitions. [2024-10-11 13:38:27,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 738 transitions. [2024-10-11 13:38:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 13:38:27,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:27,009 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:27,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:38:27,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:27,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash 665473433, now seen corresponding path program 1 times [2024-10-11 13:38:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:38:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090844540] [2024-10-11 13:38:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:38:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:38:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:38:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:38:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:38:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:38:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:38:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:38:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:38:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:38:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:38:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:38:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:38:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:38:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:38:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:38:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:38:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:38:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:38:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:38:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:38:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:38:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:38:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:38:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:38:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:38:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:38:27,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090844540] [2024-10-11 13:38:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090844540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:27,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:27,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:38:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631833550] [2024-10-11 13:38:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:27,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:38:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:38:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:38:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:38:27,528 INFO L87 Difference]: Start difference. First operand 501 states and 738 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:27,576 INFO L93 Difference]: Finished difference Result 851 states and 1255 transitions. [2024-10-11 13:38:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:38:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 186 [2024-10-11 13:38:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:27,579 INFO L225 Difference]: With dead ends: 851 [2024-10-11 13:38:27,579 INFO L226 Difference]: Without dead ends: 351 [2024-10-11 13:38:27,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:38:27,583 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:27,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 542 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:38:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-11 13:38:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 263. [2024-10-11 13:38:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 210 states have (on average 1.361904761904762) internal successors, (286), 210 states have internal predecessors, (286), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:38:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 386 transitions. [2024-10-11 13:38:27,599 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 386 transitions. Word has length 186 [2024-10-11 13:38:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:27,599 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 386 transitions. [2024-10-11 13:38:27,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 386 transitions. [2024-10-11 13:38:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:38:27,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:27,601 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:27,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:38:27,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:27,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash 783470320, now seen corresponding path program 1 times [2024-10-11 13:38:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:38:27,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102884359] [2024-10-11 13:38:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:38:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:38:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:38:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:38:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:38:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:38:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:38:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:38:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:38:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:38:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:38:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:38:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:38:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:38:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:38:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:38:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:38:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:38:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:38:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:38:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:38:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:38:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:38:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:38:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:38:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:38:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:27,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:38:27,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102884359] [2024-10-11 13:38:27,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102884359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:27,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:27,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:38:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433120282] [2024-10-11 13:38:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:27,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:38:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:38:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:38:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:38:27,992 INFO L87 Difference]: Start difference. First operand 263 states and 386 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:28,096 INFO L93 Difference]: Finished difference Result 791 states and 1160 transitions. [2024-10-11 13:38:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:38:28,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:38:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:28,100 INFO L225 Difference]: With dead ends: 791 [2024-10-11 13:38:28,100 INFO L226 Difference]: Without dead ends: 529 [2024-10-11 13:38:28,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:38:28,101 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 189 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:28,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 865 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:38:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-10-11 13:38:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 269. [2024-10-11 13:38:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 216 states have (on average 1.3518518518518519) internal successors, (292), 216 states have internal predecessors, (292), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:38:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 392 transitions. [2024-10-11 13:38:28,129 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 392 transitions. Word has length 187 [2024-10-11 13:38:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:28,130 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 392 transitions. [2024-10-11 13:38:28,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 392 transitions. [2024-10-11 13:38:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:38:28,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:28,132 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:28,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:38:28,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash -237598034, now seen corresponding path program 1 times [2024-10-11 13:38:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:38:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975088313] [2024-10-11 13:38:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:38:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:38:28,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609570485] [2024-10-11 13:38:28,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:28,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:38:28,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:38:28,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:38:28,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:38:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:38:28,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:38:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:38:29,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:38:29,839 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:38:29,840 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:38:29,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:38:30,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:38:30,046 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:30,287 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:38:30,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:38:30 BoogieIcfgContainer [2024-10-11 13:38:30,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:38:30,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:38:30,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:38:30,293 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:38:30,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:38:23" (3/4) ... [2024-10-11 13:38:30,296 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:38:30,297 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:38:30,297 INFO L158 Benchmark]: Toolchain (without parser) took 8450.01ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 81.7MB in the beginning and 223.3MB in the end (delta: -141.6MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-10-11 13:38:30,297 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:38:30,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.95ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 81.6MB in the beginning and 176.3MB in the end (delta: -94.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-10-11 13:38:30,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.15ms. Allocated memory is still 209.7MB. Free memory was 176.3MB in the beginning and 172.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:38:30,298 INFO L158 Benchmark]: Boogie Preprocessor took 99.47ms. Allocated memory is still 209.7MB. Free memory was 172.3MB in the beginning and 166.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:38:30,298 INFO L158 Benchmark]: RCFGBuilder took 890.02ms. Allocated memory is still 209.7MB. Free memory was 166.0MB in the beginning and 102.1MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-10-11 13:38:30,298 INFO L158 Benchmark]: TraceAbstraction took 7040.88ms. Allocated memory was 209.7MB in the beginning and 310.4MB in the end (delta: 100.7MB). Free memory was 102.1MB in the beginning and 224.4MB in the end (delta: -122.3MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. [2024-10-11 13:38:30,298 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 310.4MB. Free memory was 224.4MB in the beginning and 223.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:38:30,299 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.21ms. Allocated memory is still 155.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.95ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 81.6MB in the beginning and 176.3MB in the end (delta: -94.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.15ms. Allocated memory is still 209.7MB. Free memory was 176.3MB in the beginning and 172.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.47ms. Allocated memory is still 209.7MB. Free memory was 172.3MB in the beginning and 166.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 890.02ms. Allocated memory is still 209.7MB. Free memory was 166.0MB in the beginning and 102.1MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7040.88ms. Allocated memory was 209.7MB in the beginning and 310.4MB in the end (delta: 100.7MB). Free memory was 102.1MB in the beginning and 224.4MB in the end (delta: -122.3MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 310.4MB. Free memory was 224.4MB in the beginning and 223.3MB in the end (delta: 1.0MB). 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 126, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 999999.2; [L22] double var_1_1 = 999999.2; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] unsigned short int var_1_2 = 5; [L24] unsigned short int var_1_2 = 5; [L25] unsigned short int* var_1_2_Pointer = &(var_1_2); [L26] signed long int var_1_4 = -2; [L26] signed long int var_1_4 = -2; [L27] signed long int* var_1_4_Pointer = &(var_1_4); [L28] double var_1_6 = 0.0; [L28] double var_1_6 = 0.0; [L29] double* var_1_6_Pointer = &(var_1_6); [L30] double var_1_7 = 5.9; [L30] double var_1_7 = 5.9; [L31] double* var_1_7_Pointer = &(var_1_7); [L32] double var_1_8 = 255.6; [L32] double var_1_8 = 255.6; [L33] double* var_1_8_Pointer = &(var_1_8); [L34] float var_1_9 = 25.5; [L34] float var_1_9 = 25.5; [L35] float* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_10 = 0; [L36] unsigned char var_1_10 = 0; [L37] unsigned char* var_1_10_Pointer = &(var_1_10); [L38] float var_1_11 = 0.0; [L38] float var_1_11 = 0.0; [L39] float* var_1_11_Pointer = &(var_1_11); [L40] unsigned char var_1_12 = 1; [L40] unsigned char var_1_12 = 1; [L41] unsigned char* var_1_12_Pointer = &(var_1_12); [L42] unsigned char var_1_13 = 0; [L42] unsigned char var_1_13 = 0; [L43] unsigned char* var_1_13_Pointer = &(var_1_13); [L44] unsigned char var_1_14 = 0; [L44] unsigned char var_1_14 = 0; [L45] unsigned char* var_1_14_Pointer = &(var_1_14); [L46] unsigned char var_1_15 = 0; [L46] unsigned char var_1_15 = 0; [L47] unsigned char* var_1_15_Pointer = &(var_1_15); [L48] unsigned char var_1_16 = 1; [L48] unsigned char var_1_16 = 1; [L49] unsigned char* var_1_16_Pointer = &(var_1_16); [L50] unsigned char var_1_17 = 1; [L50] unsigned char var_1_17 = 1; [L51] unsigned char* var_1_17_Pointer = &(var_1_17); [L52] unsigned char var_1_18 = 64; [L52] unsigned char var_1_18 = 64; [L53] unsigned char* var_1_18_Pointer = &(var_1_18); [L54] signed char var_1_19 = -10; [L54] signed char var_1_19 = -10; [L55] signed char* var_1_19_Pointer = &(var_1_19); [L56] unsigned char var_1_20 = 5; [L56] unsigned char var_1_20 = 5; [L57] unsigned char* var_1_20_Pointer = &(var_1_20); [L58] unsigned char last_1_var_1_18 = 64; [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L123] EXPR \read(var_1_18) [L123] last_1_var_1_18 = var_1_18 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L82] var_1_2 = __VERIFIER_nondet_ushort() [L83] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] var_1_4 = __VERIFIER_nondet_long() [L86] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_6 = __VERIFIER_nondet_double() [L89] EXPR \read(var_1_6) [L89] EXPR var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F [L89] EXPR \read(var_1_6) [L89] EXPR var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR (var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR (var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] var_1_7 = __VERIFIER_nondet_double() [L91] EXPR \read(var_1_7) [L91] EXPR var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F [L91] EXPR \read(var_1_7) [L91] EXPR var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR (var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR (var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_8 = __VERIFIER_nondet_double() [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] EXPR (var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] EXPR (var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] var_1_10 = __VERIFIER_nondet_uchar() [L95] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] var_1_11 = __VERIFIER_nondet_float() [L98] EXPR \read(var_1_11) [L98] EXPR var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F [L98] EXPR \read(var_1_11) [L98] EXPR var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR (var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR (var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] var_1_13 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] var_1_14 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] var_1_17 = __VERIFIER_nondet_uchar() [L112] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] var_1_19 = __VERIFIER_nondet_char() [L115] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L117] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L117] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L117] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L118] var_1_20 = __VERIFIER_nondet_uchar() [L119] EXPR \read(var_1_20) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L119] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L119] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR \read(var_1_20) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L134] RET updateVariables() [L135] CALL step() [L62] EXPR \read(*var_1_2_Pointer) [L62] EXPR \read(*var_1_4_Pointer) [L62] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND FALSE !((((*(var_1_2_Pointer)) + (*(var_1_4_Pointer))) / (*(var_1_19_Pointer))) != last_1_var_1_18) [L65] EXPR \read(*var_1_18_Pointer) [L65] EXPR \read(*var_1_18_Pointer) [L65] EXPR \read(*var_1_18_Pointer) [L65] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L65] EXPR ((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer))) [L65] EXPR \read(*var_1_18_Pointer) [L65] EXPR ((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer))) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L65] COND TRUE ((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer))))) [L66] EXPR \read(*var_1_6_Pointer) [L66] EXPR \read(*var_1_7_Pointer) [L66] EXPR \read(*var_1_8_Pointer) [L66] (*(var_1_1_Pointer)) = (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))) [L70] EXPR \read(*var_1_18_Pointer) [L70] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L70] COND TRUE (*(var_1_18_Pointer)) == (*(var_1_18_Pointer)) [L71] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] COND TRUE (*(var_1_10_Pointer)) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR (*(var_1_13_Pointer)) || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR (*(var_1_13_Pointer)) || (*(var_1_14_Pointer)) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR (*(var_1_13_Pointer)) || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] (*(var_1_12_Pointer)) = ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))) [L77] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] COND FALSE !((*(var_1_12_Pointer))) [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR \read(*var_1_18_Pointer) [L126] EXPR \read(*var_1_18_Pointer) [L126] EXPR \read(*var_1_18_Pointer) [L126] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L126] EXPR ((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer))) [L126] EXPR \read(*var_1_18_Pointer) [L126] EXPR ((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer))) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L126] EXPR (((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer)))))) ? ((*(var_1_1_Pointer)) == ((double) (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_8_Pointer)) - (*(var_1_7_Pointer))))) [L126] EXPR \read(*var_1_1_Pointer) [L126] EXPR \read(*var_1_6_Pointer) [L126] EXPR \read(*var_1_7_Pointer) [L126] EXPR \read(*var_1_8_Pointer) [L126] EXPR (((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer)))))) ? ((*(var_1_1_Pointer)) == ((double) (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_8_Pointer)) - (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L126] EXPR ((((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer)))))) ? ((*(var_1_1_Pointer)) == ((double) (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_8_Pointer)) - (*(var_1_7_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_6_Pointer))))) - ((*(var_1_11_Pointer)) - 0.8f)))) : 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L126] EXPR ((((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer)))))) ? ((*(var_1_1_Pointer)) == ((double) (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_8_Pointer)) - (*(var_1_7_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_6_Pointer))))) - ((*(var_1_11_Pointer)) - 0.8f)))) : 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L126] EXPR (((((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer)))))) ? ((*(var_1_1_Pointer)) == ((double) (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_8_Pointer)) - (*(var_1_7_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_6_Pointer))))) - ((*(var_1_11_Pointer)) - 0.8f)))) : 1)) && (((*(var_1_18_Pointer)) == (*(var_1_18_Pointer))) ? ((*(var_1_10_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((((*(var_1_8_Pointer)) >= (*(var_1_1_Pointer))) || (*(var_1_15_Pointer))) && (((*(var_1_13_Pointer)) || (*(var_1_16_Pointer))) && (*(var_1_17_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L126] EXPR (((((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer)))))) ? ((*(var_1_1_Pointer)) == ((double) (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_8_Pointer)) - (*(var_1_7_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_6_Pointer))))) - ((*(var_1_11_Pointer)) - 0.8f)))) : 1)) && (((*(var_1_18_Pointer)) == (*(var_1_18_Pointer))) ? ((*(var_1_10_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((((*(var_1_8_Pointer)) >= (*(var_1_1_Pointer))) || (*(var_1_15_Pointer))) && (((*(var_1_13_Pointer)) || (*(var_1_16_Pointer))) && (*(var_1_17_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L126] EXPR ((((((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer)))))) ? ((*(var_1_1_Pointer)) == ((double) (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_8_Pointer)) - (*(var_1_7_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_6_Pointer))))) - ((*(var_1_11_Pointer)) - 0.8f)))) : 1)) && (((*(var_1_18_Pointer)) == (*(var_1_18_Pointer))) ? ((*(var_1_10_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((((*(var_1_8_Pointer)) >= (*(var_1_1_Pointer))) || (*(var_1_15_Pointer))) && (((*(var_1_13_Pointer)) || (*(var_1_16_Pointer))) && (*(var_1_17_Pointer))))))) : 1)) && (((((*(var_1_2_Pointer)) + (*(var_1_4_Pointer))) / (*(var_1_19_Pointer))) != last_1_var_1_18) ? ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_20_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L126] EXPR ((((((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer)))))) ? ((*(var_1_1_Pointer)) == ((double) (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_8_Pointer)) - (*(var_1_7_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_6_Pointer))))) - ((*(var_1_11_Pointer)) - 0.8f)))) : 1)) && (((*(var_1_18_Pointer)) == (*(var_1_18_Pointer))) ? ((*(var_1_10_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((((*(var_1_8_Pointer)) >= (*(var_1_1_Pointer))) || (*(var_1_15_Pointer))) && (((*(var_1_13_Pointer)) || (*(var_1_16_Pointer))) && (*(var_1_17_Pointer))))))) : 1)) && (((((*(var_1_2_Pointer)) + (*(var_1_4_Pointer))) / (*(var_1_19_Pointer))) != last_1_var_1_18) ? ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_20_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L126-L127] return ((((((*(var_1_18_Pointer)) / 32) < ((((((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) < ((*(var_1_18_Pointer)))) ? (((*(var_1_18_Pointer)) + (*(var_1_18_Pointer)))) : ((*(var_1_18_Pointer)))))) ? ((*(var_1_1_Pointer)) == ((double) (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer))) - (*(var_1_8_Pointer))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_8_Pointer)) - (*(var_1_7_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((((((*(var_1_8_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_6_Pointer))))) - ((*(var_1_11_Pointer)) - 0.8f)))) : 1)) && (((*(var_1_18_Pointer)) == (*(var_1_18_Pointer))) ? ((*(var_1_10_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((((*(var_1_8_Pointer)) >= (*(var_1_1_Pointer))) || (*(var_1_15_Pointer))) && (((*(var_1_13_Pointer)) || (*(var_1_16_Pointer))) && (*(var_1_17_Pointer))))))) : 1)) && (((((*(var_1_2_Pointer)) + (*(var_1_4_Pointer))) / (*(var_1_19_Pointer))) != last_1_var_1_18) ? ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_20_Pointer)))) : 1) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={21:0}, var_1_20_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 784 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 784 mSDsluCounter, 4088 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2752 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1336 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=4, InterpolantAutomatonStates: 29, 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, 365 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1671 NumberOfCodeBlocks, 1671 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1290 ConstructedInterpolants, 0 QuantifiedInterpolants, 2660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 8400/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:38:30,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-45.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b13a6a0e7fa67fd32bc4fd2162910d883ff12a5ba2116a1664f768b36904ccd2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:38:32,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:38:32,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:38:32,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:38:32,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:38:32,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:38:32,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:38:32,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:38:32,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:38:32,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:38:32,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:38:32,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:38:32,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:38:32,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:38:32,568 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:38:32,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:38:32,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:38:32,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:38:32,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:38:32,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:38:32,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:38:32,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:38:32,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:38:32,573 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:38:32,573 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:38:32,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:38:32,573 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:38:32,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:38:32,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:38:32,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:38:32,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:38:32,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:38:32,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:38:32,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:38:32,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:38:32,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:38:32,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:38:32,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:38:32,575 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:38:32,576 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:38:32,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:38:32,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:38:32,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:38:32,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:38:32,580 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:38:32,580 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b13a6a0e7fa67fd32bc4fd2162910d883ff12a5ba2116a1664f768b36904ccd2 [2024-10-11 13:38:32,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:38:32,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:38:32,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:38:32,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:38:32,895 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:38:32,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-45.i [2024-10-11 13:38:34,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:38:34,522 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:38:34,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-45.i [2024-10-11 13:38:34,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d162912c/a2b60928fa6346ea85483a6be7167261/FLAG45d0520be [2024-10-11 13:38:34,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d162912c/a2b60928fa6346ea85483a6be7167261 [2024-10-11 13:38:34,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:38:34,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:38:34,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:38:34,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:38:34,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:38:34,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:34,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af6c135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34, skipping insertion in model container [2024-10-11 13:38:34,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:34,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:38:34,787 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-45.i[916,929] [2024-10-11 13:38:34,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:38:34,876 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:38:34,889 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-45.i[916,929] [2024-10-11 13:38:34,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:38:34,946 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:38:34,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34 WrapperNode [2024-10-11 13:38:34,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:38:34,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:38:34,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:38:34,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:38:34,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:34,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,026 INFO L138 Inliner]: procedures = 39, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 611 [2024-10-11 13:38:35,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:38:35,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:38:35,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:38:35,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:38:35,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,102 INFO L175 MemorySlicer]: Split 150 memory accesses to 19 slices as follows [2, 7, 6, 6, 12, 10, 16, 3, 6, 8, 7, 8, 6, 6, 6, 6, 22, 7, 6]. 15 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 20 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-11 13:38:35,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:38:35,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:38:35,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:38:35,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:38:35,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (1/1) ... [2024-10-11 13:38:35,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:38:35,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:38:35,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:38:35,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:38:35,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:38:35,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:38:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:38:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:38:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:38:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:38:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-11 13:38:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-11 13:38:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-11 13:38:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-11 13:38:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#16 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#17 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#18 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:38:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-10-11 13:38:35,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#16 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#17 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#18 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:38:35,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2024-10-11 13:38:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2024-10-11 13:38:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2024-10-11 13:38:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:38:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:38:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:38:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:38:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:38:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:38:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:38:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:38:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:38:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:38:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-11 13:38:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-11 13:38:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-11 13:38:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-11 13:38:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-11 13:38:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-11 13:38:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#17 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#18 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:38:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2024-10-11 13:38:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-11 13:38:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#17 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#18 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:38:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-11 13:38:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#17 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#18 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-11 13:38:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#16 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#17 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#18 [2024-10-11 13:38:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:38:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:38:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:38:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:38:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:38:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:38:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 13:38:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-11 13:38:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-11 13:38:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-11 13:38:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-11 13:38:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-11 13:38:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-10-11 13:38:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-10-11 13:38:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-10-11 13:38:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-10-11 13:38:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2024-10-11 13:38:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#17 [2024-10-11 13:38:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#18 [2024-10-11 13:38:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:38:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:38:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:38:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:38:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:38:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:38:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:38:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:38:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:38:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:38:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-11 13:38:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-11 13:38:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-11 13:38:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-11 13:38:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-11 13:38:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-11 13:38:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2024-10-11 13:38:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#17 [2024-10-11 13:38:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#18 [2024-10-11 13:38:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:38:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:38:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:38:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:38:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:38:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:38:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:38:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#17 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#18 [2024-10-11 13:38:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-11 13:38:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#17 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#18 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:38:35,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:38:35,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:38:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2024-10-11 13:38:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-11 13:38:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-11 13:38:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-11 13:38:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-11 13:38:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-11 13:38:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-11 13:38:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2024-10-11 13:38:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#17 [2024-10-11 13:38:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#18 [2024-10-11 13:38:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:38:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:38:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:38:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:38:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#17 [2024-10-11 13:38:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#18 [2024-10-11 13:38:35,601 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:38:35,603 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:38:43,452 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-10-11 13:38:43,453 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:38:43,505 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:38:43,505 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:38:43,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:38:43 BoogieIcfgContainer [2024-10-11 13:38:43,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:38:43,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:38:43,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:38:43,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:38:43,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:38:34" (1/3) ... [2024-10-11 13:38:43,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dead748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:38:43, skipping insertion in model container [2024-10-11 13:38:43,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:38:34" (2/3) ... [2024-10-11 13:38:43,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dead748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:38:43, skipping insertion in model container [2024-10-11 13:38:43,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:38:43" (3/3) ... [2024-10-11 13:38:43,515 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-45.i [2024-10-11 13:38:43,531 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:38:43,531 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:38:43,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:38:43,595 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;@55c8d033, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:38:43,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:38:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 106 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:38:43,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 13:38:43,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:43,611 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:43,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:43,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1009589726, now seen corresponding path program 1 times [2024-10-11 13:38:43,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:38:43,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753957877] [2024-10-11 13:38:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:43,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:38:43,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:38:43,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:38:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:44,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:38:44,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:38:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-10-11 13:38:44,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:38:44,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:38:44,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753957877] [2024-10-11 13:38:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753957877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:44,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:38:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657713882] [2024-10-11 13:38:44,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:44,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:38:44,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:38:44,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:38:44,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:38:44,403 INFO L87 Difference]: Start difference. First operand has 133 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 106 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:38:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:44,464 INFO L93 Difference]: Finished difference Result 263 states and 421 transitions. [2024-10-11 13:38:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:38:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 184 [2024-10-11 13:38:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:44,477 INFO L225 Difference]: With dead ends: 263 [2024-10-11 13:38:44,477 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 13:38:44,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:38:44,487 INFO L432 NwaCegarLoop]: 190 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, 190 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:44,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:38:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 13:38:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-11 13:38:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:38:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 194 transitions. [2024-10-11 13:38:44,535 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 194 transitions. Word has length 184 [2024-10-11 13:38:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:44,535 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 194 transitions. [2024-10-11 13:38:44,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:38:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 194 transitions. [2024-10-11 13:38:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 13:38:44,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:44,543 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:44,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:38:44,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:44,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:44,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 824130940, now seen corresponding path program 1 times [2024-10-11 13:38:44,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:38:44,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655073051] [2024-10-11 13:38:44,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:44,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:38:44,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:38:44,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:38:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:45,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:38:45,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:38:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-10-11 13:38:45,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:38:45,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:38:45,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655073051] [2024-10-11 13:38:45,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655073051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:45,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:45,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:38:45,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867863459] [2024-10-11 13:38:45,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:45,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:38:45,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:38:45,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:38:45,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:38:45,532 INFO L87 Difference]: Start difference. First operand 131 states and 194 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:38:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:45,685 INFO L93 Difference]: Finished difference Result 263 states and 390 transitions. [2024-10-11 13:38:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:38:45,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 184 [2024-10-11 13:38:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:45,691 INFO L225 Difference]: With dead ends: 263 [2024-10-11 13:38:45,692 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 13:38:45,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:38:45,693 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 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-11 13:38:45,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:38:45,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 13:38:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-11 13:38:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:38:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2024-10-11 13:38:45,704 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 184 [2024-10-11 13:38:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:45,708 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2024-10-11 13:38:45,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:38:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2024-10-11 13:38:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 13:38:45,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:45,711 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:45,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:38:45,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:45,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:45,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash 413520574, now seen corresponding path program 1 times [2024-10-11 13:38:45,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:38:45,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746373571] [2024-10-11 13:38:45,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:45,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:45,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:38:45,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:38:45,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:38:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:46,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:38:46,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:38:47,952 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 33 treesize of output 17 [2024-10-11 13:38:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:48,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:38:48,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:38:48,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746373571] [2024-10-11 13:38:48,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746373571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:48,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:48,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:38:48,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592776086] [2024-10-11 13:38:48,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:48,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:38:48,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:38:48,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:38:48,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:38:48,008 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:49,466 INFO L93 Difference]: Finished difference Result 397 states and 586 transitions. [2024-10-11 13:38:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:38:49,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 184 [2024-10-11 13:38:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:49,471 INFO L225 Difference]: With dead ends: 397 [2024-10-11 13:38:49,471 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 13:38:49,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:38:49,472 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 99 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:49,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 539 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 13:38:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 13:38:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2024-10-11 13:38:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 210 states have (on average 1.3761904761904762) internal successors, (289), 210 states have internal predecessors, (289), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:38:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2024-10-11 13:38:49,508 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 184 [2024-10-11 13:38:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:49,512 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2024-10-11 13:38:49,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2024-10-11 13:38:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 13:38:49,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:49,514 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:49,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:38:49,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:49,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:49,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1580624132, now seen corresponding path program 1 times [2024-10-11 13:38:49,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:38:49,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594397330] [2024-10-11 13:38:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:49,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:49,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:38:49,718 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:38:49,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:38:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:50,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:38:50,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:38:51,472 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 25 treesize of output 13 [2024-10-11 13:38:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:51,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:38:51,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:38:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594397330] [2024-10-11 13:38:51,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594397330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:51,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:51,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:38:51,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991001089] [2024-10-11 13:38:51,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:51,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:38:51,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:38:51,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:38:51,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:38:51,491 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:51,759 INFO L93 Difference]: Finished difference Result 527 states and 778 transitions. [2024-10-11 13:38:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:38:51,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 184 [2024-10-11 13:38:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:51,761 INFO L225 Difference]: With dead ends: 527 [2024-10-11 13:38:51,762 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 13:38:51,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:38:51,763 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 95 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:51,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 646 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:38:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 13:38:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2024-10-11 13:38:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 210 states have (on average 1.3714285714285714) internal successors, (288), 210 states have internal predecessors, (288), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:38:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2024-10-11 13:38:51,782 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 388 transitions. Word has length 184 [2024-10-11 13:38:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:51,783 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 388 transitions. [2024-10-11 13:38:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 388 transitions. [2024-10-11 13:38:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 13:38:51,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:51,785 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:51,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:38:51,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:51,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:51,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:51,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1231169024, now seen corresponding path program 1 times [2024-10-11 13:38:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:38:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315953758] [2024-10-11 13:38:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:51,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:38:51,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:38:51,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:38:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:52,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:38:52,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:38:52,649 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 25 treesize of output 13 [2024-10-11 13:38:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:52,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:38:52,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:38:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315953758] [2024-10-11 13:38:52,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315953758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:52,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:52,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:38:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655180321] [2024-10-11 13:38:52,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:52,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:38:52,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:38:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:38:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:38:52,712 INFO L87 Difference]: Start difference. First operand 263 states and 388 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:53,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:38:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:53,950 INFO L93 Difference]: Finished difference Result 395 states and 583 transitions. [2024-10-11 13:38:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:38:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 184 [2024-10-11 13:38:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:53,953 INFO L225 Difference]: With dead ends: 395 [2024-10-11 13:38:53,953 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 13:38:53,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:38:53,954 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:53,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 13:38:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 13:38:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-10-11 13:38:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 210 states have (on average 1.3666666666666667) internal successors, (287), 210 states have internal predecessors, (287), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:38:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2024-10-11 13:38:53,971 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 184 [2024-10-11 13:38:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:53,971 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2024-10-11 13:38:53,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2024-10-11 13:38:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 13:38:53,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:53,974 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:53,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 13:38:54,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:54,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:54,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash -762975682, now seen corresponding path program 1 times [2024-10-11 13:38:54,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:38:54,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557171013] [2024-10-11 13:38:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:54,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:54,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:38:54,179 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:38:54,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 13:38:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:54,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:38:54,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:38:54,815 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-11 13:38:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:38:54,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:38:54,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:38:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557171013] [2024-10-11 13:38:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557171013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:38:54,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:38:54,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:38:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894724896] [2024-10-11 13:38:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:38:54,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:38:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:38:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:38:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:38:54,844 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:54,921 INFO L93 Difference]: Finished difference Result 395 states and 581 transitions. [2024-10-11 13:38:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:38:54,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 184 [2024-10-11 13:38:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:54,924 INFO L225 Difference]: With dead ends: 395 [2024-10-11 13:38:54,924 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 13:38:54,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:38:54,925 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:54,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:38:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 13:38:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 133. [2024-10-11 13:38:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 106 states have internal predecessors, (144), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:38:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2024-10-11 13:38:54,933 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 184 [2024-10-11 13:38:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:54,934 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2024-10-11 13:38:54,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:38:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2024-10-11 13:38:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:38:54,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:54,935 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:54,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 13:38:55,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:55,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:55,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash 82405742, now seen corresponding path program 1 times [2024-10-11 13:38:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:38:55,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577016359] [2024-10-11 13:38:55,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:55,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:55,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:38:55,139 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:38:55,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 13:38:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:55,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:38:55,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:38:56,803 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 33 treesize of output 21 [2024-10-11 13:38:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 13 proven. 655 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-11 13:38:56,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:38:57,270 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:38:57,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-10-11 13:38:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 13:38:57,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:38:57,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577016359] [2024-10-11 13:38:57,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577016359] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:38:57,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:38:57,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-10-11 13:38:57,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86867205] [2024-10-11 13:38:57,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:38:57,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:38:57,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:38:57,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:38:57,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:38:57,654 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 11 states, 9 states have (on average 8.666666666666666) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) [2024-10-11 13:38:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:38:58,588 INFO L93 Difference]: Finished difference Result 273 states and 394 transitions. [2024-10-11 13:38:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:38:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.666666666666666) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) Word has length 187 [2024-10-11 13:38:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:38:58,590 INFO L225 Difference]: With dead ends: 273 [2024-10-11 13:38:58,590 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 13:38:58,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:38:58,591 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 576 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:38:58,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 687 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:38:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 13:38:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-10-11 13:38:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 109 states have internal predecessors, (146), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:38:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 196 transitions. [2024-10-11 13:38:58,602 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 196 transitions. Word has length 187 [2024-10-11 13:38:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:38:58,603 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 196 transitions. [2024-10-11 13:38:58,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.666666666666666) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) [2024-10-11 13:38:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 196 transitions. [2024-10-11 13:38:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:38:58,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:38:58,604 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:38:58,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 13:38:58,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:58,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:38:58,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:38:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash -938662612, now seen corresponding path program 1 times [2024-10-11 13:38:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:38:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738758591] [2024-10-11 13:38:58,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:38:58,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:38:58,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:38:58,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:38:58,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 13:38:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:38:59,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:38:59,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:00,349 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 33 treesize of output 17 [2024-10-11 13:39:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 13:39:00,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:39:00,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:39:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738758591] [2024-10-11 13:39:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738758591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:00,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:00,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:39:00,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265704074] [2024-10-11 13:39:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:00,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:39:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:39:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:39:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:39:00,381 INFO L87 Difference]: Start difference. First operand 137 states and 196 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:39:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:00,627 INFO L93 Difference]: Finished difference Result 409 states and 586 transitions. [2024-10-11 13:39:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:39:00,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2024-10-11 13:39:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:00,631 INFO L225 Difference]: With dead ends: 409 [2024-10-11 13:39:00,631 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 13:39:00,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:39:00,632 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 86 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:00,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 535 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:39:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 13:39:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2024-10-11 13:39:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.337962962962963) internal successors, (289), 216 states have internal predecessors, (289), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:39:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 389 transitions. [2024-10-11 13:39:00,646 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 389 transitions. Word has length 187 [2024-10-11 13:39:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:00,647 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 389 transitions. [2024-10-11 13:39:00,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 13:39:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 389 transitions. [2024-10-11 13:39:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 13:39:00,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:00,649 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:39:00,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 13:39:00,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:00,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:00,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash -237598034, now seen corresponding path program 1 times [2024-10-11 13:39:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:39:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861897835] [2024-10-11 13:39:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:00,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:00,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:39:00,854 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:39:00,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 13:39:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:01,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:39:01,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:01,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:39:01,834 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 157 treesize of output 67 [2024-10-11 13:39:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-10-11 13:39:01,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:39:01,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:39:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861897835] [2024-10-11 13:39:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861897835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:01,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:39:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027346589] [2024-10-11 13:39:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:01,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:01,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:39:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:01,885 INFO L87 Difference]: Start difference. First operand 271 states and 389 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:39:03,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:05,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:09,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:09,735 INFO L93 Difference]: Finished difference Result 543 states and 779 transitions. [2024-10-11 13:39:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:39:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2024-10-11 13:39:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:09,738 INFO L225 Difference]: With dead ends: 543 [2024-10-11 13:39:09,738 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 13:39:09,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:39:09,739 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 174 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:09,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 593 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-10-11 13:39:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 13:39:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2024-10-11 13:39:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.3287037037037037) internal successors, (287), 216 states have internal predecessors, (287), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:39:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 387 transitions. [2024-10-11 13:39:09,763 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 387 transitions. Word has length 187 [2024-10-11 13:39:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:09,764 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 387 transitions. [2024-10-11 13:39:09,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:39:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 387 transitions. [2024-10-11 13:39:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 13:39:09,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:09,765 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:39:09,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-11 13:39:09,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:09,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:09,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:09,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1824387506, now seen corresponding path program 1 times [2024-10-11 13:39:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:39:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522154961] [2024-10-11 13:39:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:09,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:09,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:39:09,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:39:09,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 13:39:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:10,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:39:10,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2024-10-11 13:39:10,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:39:10,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:39:10,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522154961] [2024-10-11 13:39:10,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522154961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:10,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:10,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:39:10,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232853770] [2024-10-11 13:39:10,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:10,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:39:10,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:10,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:10,616 INFO L87 Difference]: Start difference. First operand 271 states and 387 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-10-11 13:39:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:11,119 INFO L93 Difference]: Finished difference Result 553 states and 787 transitions. [2024-10-11 13:39:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:39:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 189 [2024-10-11 13:39:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:11,121 INFO L225 Difference]: With dead ends: 553 [2024-10-11 13:39:11,121 INFO L226 Difference]: Without dead ends: 279 [2024-10-11 13:39:11,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:39:11,123 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 1 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:11,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 732 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:39:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-11 13:39:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2024-10-11 13:39:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.3194444444444444) internal successors, (285), 216 states have internal predecessors, (285), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:39:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 385 transitions. [2024-10-11 13:39:11,143 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 385 transitions. Word has length 189 [2024-10-11 13:39:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:11,144 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 385 transitions. [2024-10-11 13:39:11,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-10-11 13:39:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 385 transitions. [2024-10-11 13:39:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 13:39:11,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:11,146 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:39:11,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 13:39:11,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:11,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:11,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1684581900, now seen corresponding path program 1 times [2024-10-11 13:39:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:39:11,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193891616] [2024-10-11 13:39:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:11,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:11,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:39:11,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:39:11,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 13:39:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:12,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:39:12,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:12,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:39:12,361 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-11 13:39:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-11 13:39:12,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:39:12,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:39:12,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193891616] [2024-10-11 13:39:12,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193891616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:12,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:12,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:39:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18368490] [2024-10-11 13:39:12,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:12,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:12,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:39:12,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:12,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:12,407 INFO L87 Difference]: Start difference. First operand 271 states and 385 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:39:14,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:17,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:19,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:19,889 INFO L93 Difference]: Finished difference Result 543 states and 771 transitions. [2024-10-11 13:39:19,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:39:19,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2024-10-11 13:39:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:19,891 INFO L225 Difference]: With dead ends: 543 [2024-10-11 13:39:19,891 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 13:39:19,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 184 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-11 13:39:19,893 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 164 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:19,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 589 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-10-11 13:39:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 13:39:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2024-10-11 13:39:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.3101851851851851) internal successors, (283), 216 states have internal predecessors, (283), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:39:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 383 transitions. [2024-10-11 13:39:19,904 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 383 transitions. Word has length 189 [2024-10-11 13:39:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:19,904 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 383 transitions. [2024-10-11 13:39:19,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:39:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 383 transitions. [2024-10-11 13:39:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-11 13:39:19,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:19,906 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:39:19,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 13:39:20,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:20,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:20,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2136625426, now seen corresponding path program 1 times [2024-10-11 13:39:20,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:39:20,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936095946] [2024-10-11 13:39:20,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:20,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:39:20,109 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:39:20,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 13:39:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:20,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:39:20,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:21,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:39:21,144 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-11 13:39:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-10-11 13:39:21,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:39:21,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:39:21,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936095946] [2024-10-11 13:39:21,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936095946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:21,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:21,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:39:21,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292207936] [2024-10-11 13:39:21,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:21,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:21,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:39:21,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:21,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:21,197 INFO L87 Difference]: Start difference. First operand 271 states and 383 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:39:25,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:27,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:29,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:29,645 INFO L93 Difference]: Finished difference Result 541 states and 765 transitions. [2024-10-11 13:39:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:39:29,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 191 [2024-10-11 13:39:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:29,647 INFO L225 Difference]: With dead ends: 541 [2024-10-11 13:39:29,647 INFO L226 Difference]: Without dead ends: 271 [2024-10-11 13:39:29,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:39:29,648 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 155 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:29,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 576 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-10-11 13:39:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-11 13:39:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2024-10-11 13:39:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.3066037735849056) internal successors, (277), 212 states have internal predecessors, (277), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:39:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2024-10-11 13:39:29,660 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 191 [2024-10-11 13:39:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:29,660 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2024-10-11 13:39:29,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:39:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2024-10-11 13:39:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 13:39:29,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:29,661 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:39:29,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 13:39:29,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:29,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:29,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1094710326, now seen corresponding path program 1 times [2024-10-11 13:39:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:39:29,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259693961] [2024-10-11 13:39:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:29,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:29,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:39:29,864 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:39:29,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 13:39:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:30,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:39:30,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:30,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:39:30,901 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 154 treesize of output 64 [2024-10-11 13:39:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 504 proven. 24 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-11 13:39:31,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:39:31,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:39:31,450 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 98 treesize of output 1 [2024-10-11 13:39:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 13:39:31,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:39:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259693961] [2024-10-11 13:39:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259693961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:39:31,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:39:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-11 13:39:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199741806] [2024-10-11 13:39:31,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:39:31,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:39:31,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:39:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:39:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:39:31,487 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 12 states have internal predecessors, (104), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-10-11 13:39:36,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:40,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:40,649 INFO L93 Difference]: Finished difference Result 563 states and 787 transitions. [2024-10-11 13:39:40,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:39:40,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 12 states have internal predecessors, (104), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) Word has length 193 [2024-10-11 13:39:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:40,651 INFO L225 Difference]: With dead ends: 563 [2024-10-11 13:39:40,651 INFO L226 Difference]: Without dead ends: 275 [2024-10-11 13:39:40,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:39:40,653 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 151 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:40,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 711 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-10-11 13:39:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-11 13:39:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 267. [2024-10-11 13:39:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.2877358490566038) internal successors, (273), 212 states have internal predecessors, (273), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:39:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 373 transitions. [2024-10-11 13:39:40,672 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 373 transitions. Word has length 193 [2024-10-11 13:39:40,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:40,673 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 373 transitions. [2024-10-11 13:39:40,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 12 states have internal predecessors, (104), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-10-11 13:39:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 373 transitions. [2024-10-11 13:39:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 13:39:40,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:40,674 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:39:40,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 13:39:40,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:40,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash -802269132, now seen corresponding path program 1 times [2024-10-11 13:39:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:39:40,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019437726] [2024-10-11 13:39:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:40,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:39:40,879 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:39:40,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 13:39:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:39:41,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:39:41,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:39:41,703 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 79 treesize of output 43 [2024-10-11 13:39:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-10-11 13:39:41,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:39:41,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:39:41,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019437726] [2024-10-11 13:39:41,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019437726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:39:41,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:39:41,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:39:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547991787] [2024-10-11 13:39:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:39:41,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:39:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:39:41,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:39:41,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:39:41,736 INFO L87 Difference]: Start difference. First operand 267 states and 373 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:39:45,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:47,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:51,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:39:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:39:51,308 INFO L93 Difference]: Finished difference Result 535 states and 747 transitions. [2024-10-11 13:39:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:39:51,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 193 [2024-10-11 13:39:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:39:51,311 INFO L225 Difference]: With dead ends: 535 [2024-10-11 13:39:51,311 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 13:39:51,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 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-11 13:39:51,312 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 137 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:39:51,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 570 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-10-11 13:39:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 13:39:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2024-10-11 13:39:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.278301886792453) internal successors, (271), 212 states have internal predecessors, (271), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:39:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 371 transitions. [2024-10-11 13:39:51,329 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 371 transitions. Word has length 193 [2024-10-11 13:39:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:39:51,329 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 371 transitions. [2024-10-11 13:39:51,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 13:39:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 371 transitions. [2024-10-11 13:39:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 13:39:51,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:39:51,331 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:39:51,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-11 13:39:51,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:51,531 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:39:51,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:39:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash -105207506, now seen corresponding path program 1 times [2024-10-11 13:39:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:39:51,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542529795] [2024-10-11 13:39:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:39:51,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:39:51,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:39:51,536 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:39:51,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process