./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-ap_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efbce6a3c3cc86de2fbc1d4647db693e04b33292f9edfaeea674d0c6a2cba64f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:34:47,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:34:47,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:34:47,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:34:47,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:34:47,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:34:47,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:34:47,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:34:47,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:34:47,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:34:47,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:34:47,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:34:47,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:34:47,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:34:47,738 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:34:47,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:34:47,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:34:47,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:34:47,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:34:47,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:34:47,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:34:47,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:34:47,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:34:47,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:34:47,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:34:47,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:34:47,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:34:47,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:34:47,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:34:47,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:34:47,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:34:47,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:34:47,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:34:47,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:34:47,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:34:47,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:34:47,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:34:47,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:34:47,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:34:47,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:34:47,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:34:47,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:34:47,748 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efbce6a3c3cc86de2fbc1d4647db693e04b33292f9edfaeea674d0c6a2cba64f [2024-11-20 08:34:47,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:34:48,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:34:48,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:34:48,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:34:48,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:34:48,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i [2024-11-20 08:34:49,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:34:49,721 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:34:49,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i [2024-11-20 08:34:49,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb4f587e/6585ed7995d14737a7e52551f94a6dcc/FLAGc2e369910 [2024-11-20 08:34:49,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb4f587e/6585ed7995d14737a7e52551f94a6dcc [2024-11-20 08:34:49,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:34:49,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:34:49,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:34:49,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:34:49,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:34:49,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:34:49" (1/1) ... [2024-11-20 08:34:49,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd09bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:49, skipping insertion in model container [2024-11-20 08:34:49,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:34:49" (1/1) ... [2024-11-20 08:34:49,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:34:49,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i[917,930] [2024-11-20 08:34:50,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:34:50,081 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:34:50,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i[917,930] [2024-11-20 08:34:50,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:34:50,161 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:34:50,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50 WrapperNode [2024-11-20 08:34:50,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:34:50,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:34:50,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:34:50,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:34:50,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,226 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2024-11-20 08:34:50,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:34:50,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:34:50,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:34:50,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:34:50,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,268 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2024-11-20 08:34:50,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:34:50,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:34:50,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:34:50,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:34:50,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (1/1) ... [2024-11-20 08:34:50,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:34:50,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:34:50,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:34:50,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:34:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:34:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:34:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:34:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:34:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:34:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:34:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:34:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:34:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:34:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:34:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:34:50,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:34:50,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:34:50,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:34:50,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:34:50,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:34:50,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:34:50,564 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:34:50,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:34:51,124 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-20 08:34:51,124 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:34:51,143 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:34:51,144 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:34:51,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:34:51 BoogieIcfgContainer [2024-11-20 08:34:51,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:34:51,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:34:51,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:34:51,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:34:51,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:34:49" (1/3) ... [2024-11-20 08:34:51,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af49f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:34:51, skipping insertion in model container [2024-11-20 08:34:51,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:50" (2/3) ... [2024-11-20 08:34:51,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af49f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:34:51, skipping insertion in model container [2024-11-20 08:34:51,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:34:51" (3/3) ... [2024-11-20 08:34:51,155 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-34.i [2024-11-20 08:34:51,172 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:34:51,172 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:34:51,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:34:51,245 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;@4cd2e310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:34:51,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:34:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:34:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:34:51,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:51,270 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:51,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:51,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1263040471, now seen corresponding path program 1 times [2024-11-20 08:34:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:51,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344654955] [2024-11-20 08:34:51,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:51,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:51,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:51,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344654955] [2024-11-20 08:34:51,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344654955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:51,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:51,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:34:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059145437] [2024-11-20 08:34:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:51,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:34:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:51,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:34:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:34:51,729 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:34:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:51,762 INFO L93 Difference]: Finished difference Result 233 states and 367 transitions. [2024-11-20 08:34:51,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:34:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-20 08:34:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:51,776 INFO L225 Difference]: With dead ends: 233 [2024-11-20 08:34:51,777 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 08:34:51,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:34:51,786 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:51,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:34:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 08:34:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-20 08:34:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:34:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-20 08:34:51,833 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2024-11-20 08:34:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:51,833 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-20 08:34:51,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:34:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-20 08:34:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:34:51,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:51,838 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:51,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:34:51,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:51,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1556431919, now seen corresponding path program 1 times [2024-11-20 08:34:51,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144817458] [2024-11-20 08:34:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:52,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144817458] [2024-11-20 08:34:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144817458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:52,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:52,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:34:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289094146] [2024-11-20 08:34:52,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:52,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:34:52,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:52,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:34:52,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:34:52,310 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:34:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:52,365 INFO L93 Difference]: Finished difference Result 231 states and 336 transitions. [2024-11-20 08:34:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:34:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-20 08:34:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:52,367 INFO L225 Difference]: With dead ends: 231 [2024-11-20 08:34:52,367 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 08:34:52,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:34:52,372 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:52,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:34:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 08:34:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-20 08:34:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:34:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-20 08:34:52,393 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 171 [2024-11-20 08:34:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:52,394 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-20 08:34:52,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:34:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-20 08:34:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:34:52,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:52,397 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:52,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:34:52,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:52,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:52,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2115253775, now seen corresponding path program 1 times [2024-11-20 08:34:52,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:52,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084350358] [2024-11-20 08:34:52,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:52,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084350358] [2024-11-20 08:34:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084350358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:52,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:34:52,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939499177] [2024-11-20 08:34:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:52,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:34:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:52,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:34:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:52,656 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:52,678 INFO L93 Difference]: Finished difference Result 234 states and 339 transitions. [2024-11-20 08:34:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:34:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-11-20 08:34:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:52,681 INFO L225 Difference]: With dead ends: 234 [2024-11-20 08:34:52,681 INFO L226 Difference]: Without dead ends: 119 [2024-11-20 08:34:52,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:52,683 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:52,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:34:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-20 08:34:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-20 08:34:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:34:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-20 08:34:52,693 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 171 [2024-11-20 08:34:52,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:52,694 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-20 08:34:52,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-20 08:34:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:34:52,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:52,696 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:34:52,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1362065071, now seen corresponding path program 1 times [2024-11-20 08:34:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519260135] [2024-11-20 08:34:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:53,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:53,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519260135] [2024-11-20 08:34:53,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519260135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:53,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:53,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:34:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923810299] [2024-11-20 08:34:53,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:53,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:34:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:53,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:34:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:34:53,019 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:53,052 INFO L93 Difference]: Finished difference Result 237 states and 342 transitions. [2024-11-20 08:34:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:34:53,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-11-20 08:34:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:53,066 INFO L225 Difference]: With dead ends: 237 [2024-11-20 08:34:53,066 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 08:34:53,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:34:53,072 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:53,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:34:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 08:34:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-20 08:34:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:34:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2024-11-20 08:34:53,090 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 171 [2024-11-20 08:34:53,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:53,093 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2024-11-20 08:34:53,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-20 08:34:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 08:34:53,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:53,101 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:53,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:34:53,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash -103652351, now seen corresponding path program 1 times [2024-11-20 08:34:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:53,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272743623] [2024-11-20 08:34:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272743623] [2024-11-20 08:34:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272743623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:53,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:34:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001117467] [2024-11-20 08:34:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:53,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:34:53,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:53,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:34:53,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:53,312 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:53,354 INFO L93 Difference]: Finished difference Result 289 states and 415 transitions. [2024-11-20 08:34:53,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:34:53,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-11-20 08:34:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:53,357 INFO L225 Difference]: With dead ends: 289 [2024-11-20 08:34:53,357 INFO L226 Difference]: Without dead ends: 171 [2024-11-20 08:34:53,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:53,358 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:53,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:34:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-20 08:34:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2024-11-20 08:34:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 115 states have internal predecessors, (155), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:34:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 201 transitions. [2024-11-20 08:34:53,367 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 201 transitions. Word has length 173 [2024-11-20 08:34:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:53,367 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 201 transitions. [2024-11-20 08:34:53,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 201 transitions. [2024-11-20 08:34:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-20 08:34:53,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:53,370 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:53,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:34:53,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:53,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 641310293, now seen corresponding path program 1 times [2024-11-20 08:34:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:53,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726948031] [2024-11-20 08:34:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:53,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:53,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:53,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726948031] [2024-11-20 08:34:53,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726948031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:53,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:53,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:34:53,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608692900] [2024-11-20 08:34:53,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:53,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:34:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:53,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:34:53,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:53,521 INFO L87 Difference]: Start difference. First operand 140 states and 201 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:53,540 INFO L93 Difference]: Finished difference Result 278 states and 401 transitions. [2024-11-20 08:34:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:34:53,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2024-11-20 08:34:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:53,543 INFO L225 Difference]: With dead ends: 278 [2024-11-20 08:34:53,544 INFO L226 Difference]: Without dead ends: 141 [2024-11-20 08:34:53,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:53,545 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:53,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:34:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-20 08:34:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-20 08:34:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:34:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-11-20 08:34:53,563 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 176 [2024-11-20 08:34:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:53,563 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-11-20 08:34:53,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-11-20 08:34:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-20 08:34:53,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:53,567 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:53,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:34:53,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:53,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:53,567 INFO L85 PathProgramCache]: Analyzing trace with hash 54504279, now seen corresponding path program 1 times [2024-11-20 08:34:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:53,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438486755] [2024-11-20 08:34:53,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:53,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:54,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:54,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438486755] [2024-11-20 08:34:54,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438486755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:54,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:54,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:34:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763651090] [2024-11-20 08:34:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:54,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:34:54,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:34:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:34:54,365 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-20 08:34:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:55,051 INFO L93 Difference]: Finished difference Result 496 states and 709 transitions. [2024-11-20 08:34:55,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:34:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2024-11-20 08:34:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:55,054 INFO L225 Difference]: With dead ends: 496 [2024-11-20 08:34:55,054 INFO L226 Difference]: Without dead ends: 358 [2024-11-20 08:34:55,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:34:55,055 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 750 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:55,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 655 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:34:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-20 08:34:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 351. [2024-11-20 08:34:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 286 states have (on average 1.332167832167832) internal successors, (381), 287 states have internal predecessors, (381), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-20 08:34:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 503 transitions. [2024-11-20 08:34:55,090 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 503 transitions. Word has length 176 [2024-11-20 08:34:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:55,091 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 503 transitions. [2024-11-20 08:34:55,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-20 08:34:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 503 transitions. [2024-11-20 08:34:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 08:34:55,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:55,093 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:55,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:34:55,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:55,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:55,094 INFO L85 PathProgramCache]: Analyzing trace with hash -154267007, now seen corresponding path program 1 times [2024-11-20 08:34:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:55,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234487717] [2024-11-20 08:34:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:55,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:55,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234487717] [2024-11-20 08:34:55,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234487717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:55,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:55,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:34:55,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355221408] [2024-11-20 08:34:55,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:55,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:34:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:55,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:34:55,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:34:55,965 INFO L87 Difference]: Start difference. First operand 351 states and 503 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-20 08:34:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:56,679 INFO L93 Difference]: Finished difference Result 702 states and 1003 transitions. [2024-11-20 08:34:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:34:56,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178 [2024-11-20 08:34:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:56,683 INFO L225 Difference]: With dead ends: 702 [2024-11-20 08:34:56,683 INFO L226 Difference]: Without dead ends: 354 [2024-11-20 08:34:56,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:34:56,686 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 719 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:56,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 749 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:34:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-20 08:34:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2024-11-20 08:34:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 283 states have (on average 1.3286219081272084) internal successors, (376), 284 states have internal predecessors, (376), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-20 08:34:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 498 transitions. [2024-11-20 08:34:56,723 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 498 transitions. Word has length 178 [2024-11-20 08:34:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:56,723 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 498 transitions. [2024-11-20 08:34:56,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-20 08:34:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 498 transitions. [2024-11-20 08:34:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 08:34:56,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:56,727 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:56,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:34:56,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:56,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash 731946335, now seen corresponding path program 1 times [2024-11-20 08:34:56,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:56,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983769810] [2024-11-20 08:34:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983769810] [2024-11-20 08:34:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983769810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:56,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:56,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:34:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113626149] [2024-11-20 08:34:56,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:56,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:34:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:34:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:56,870 INFO L87 Difference]: Start difference. First operand 348 states and 498 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:56,907 INFO L93 Difference]: Finished difference Result 773 states and 1106 transitions. [2024-11-20 08:34:56,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:34:56,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2024-11-20 08:34:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:56,911 INFO L225 Difference]: With dead ends: 773 [2024-11-20 08:34:56,911 INFO L226 Difference]: Without dead ends: 428 [2024-11-20 08:34:56,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:56,914 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 59 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:56,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 380 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:34:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-20 08:34:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 348. [2024-11-20 08:34:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 283 states have (on average 1.3003533568904593) internal successors, (368), 284 states have internal predecessors, (368), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-20 08:34:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 490 transitions. [2024-11-20 08:34:56,941 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 490 transitions. Word has length 178 [2024-11-20 08:34:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:56,944 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 490 transitions. [2024-11-20 08:34:56,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:34:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 490 transitions. [2024-11-20 08:34:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 08:34:56,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:56,946 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 08:34:56,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash 374748692, now seen corresponding path program 1 times [2024-11-20 08:34:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:56,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453502625] [2024-11-20 08:34:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:34:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:34:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:34:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:34:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:34:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:34:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:34:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:34:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:34:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:34:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:34:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:34:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:34:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:34:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:34:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:34:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:34:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:34:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:34:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:34:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:34:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:34:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:34:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:34:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:34:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:34:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453502625] [2024-11-20 08:34:58,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453502625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:58,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:58,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 08:34:58,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136333781] [2024-11-20 08:34:58,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:58,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:34:58,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:34:58,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:34:58,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:34:58,792 INFO L87 Difference]: Start difference. First operand 348 states and 490 transitions. Second operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 08:34:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:59,880 INFO L93 Difference]: Finished difference Result 966 states and 1349 transitions. [2024-11-20 08:34:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 08:34:59,881 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 179 [2024-11-20 08:34:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:59,885 INFO L225 Difference]: With dead ends: 966 [2024-11-20 08:34:59,885 INFO L226 Difference]: Without dead ends: 621 [2024-11-20 08:34:59,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2024-11-20 08:34:59,886 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 362 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:59,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1172 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:34:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-20 08:34:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 484. [2024-11-20 08:34:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 394 states have (on average 1.281725888324873) internal successors, (505), 397 states have internal predecessors, (505), 83 states have call successors, (83), 6 states have call predecessors, (83), 6 states have return successors, (83), 80 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-20 08:34:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 671 transitions. [2024-11-20 08:34:59,945 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 671 transitions. Word has length 179 [2024-11-20 08:34:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:59,946 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 671 transitions. [2024-11-20 08:34:59,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 08:34:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 671 transitions. [2024-11-20 08:34:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:34:59,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:59,948 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 08:34:59,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:59,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2086298773, now seen corresponding path program 1 times [2024-11-20 08:34:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:34:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273791887] [2024-11-20 08:34:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:00,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:00,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273791887] [2024-11-20 08:35:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273791887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:00,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:00,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:35:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575339569] [2024-11-20 08:35:00,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:00,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:35:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:00,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:35:00,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:35:00,729 INFO L87 Difference]: Start difference. First operand 484 states and 671 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:00,949 INFO L93 Difference]: Finished difference Result 1196 states and 1646 transitions. [2024-11-20 08:35:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:35:00,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:00,954 INFO L225 Difference]: With dead ends: 1196 [2024-11-20 08:35:00,954 INFO L226 Difference]: Without dead ends: 715 [2024-11-20 08:35:00,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:35:00,956 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 53 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:00,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1186 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:35:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-20 08:35:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 613. [2024-11-20 08:35:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 523 states have (on average 1.282982791586998) internal successors, (671), 526 states have internal predecessors, (671), 83 states have call successors, (83), 6 states have call predecessors, (83), 6 states have return successors, (83), 80 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-20 08:35:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 837 transitions. [2024-11-20 08:35:01,036 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 837 transitions. Word has length 180 [2024-11-20 08:35:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:01,037 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 837 transitions. [2024-11-20 08:35:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 837 transitions. [2024-11-20 08:35:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:01,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:01,041 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:01,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:35:01,041 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:01,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1385234195, now seen corresponding path program 1 times [2024-11-20 08:35:01,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:01,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803282278] [2024-11-20 08:35:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:01,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:01,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803282278] [2024-11-20 08:35:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803282278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:01,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:35:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002855747] [2024-11-20 08:35:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:01,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:35:01,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:01,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:35:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:01,205 INFO L87 Difference]: Start difference. First operand 613 states and 837 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:01,271 INFO L93 Difference]: Finished difference Result 1248 states and 1706 transitions. [2024-11-20 08:35:01,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:35:01,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:01,275 INFO L225 Difference]: With dead ends: 1248 [2024-11-20 08:35:01,275 INFO L226 Difference]: Without dead ends: 638 [2024-11-20 08:35:01,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:01,277 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:01,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 467 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-20 08:35:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 633. [2024-11-20 08:35:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 543 states have (on average 1.2725598526703499) internal successors, (691), 546 states have internal predecessors, (691), 83 states have call successors, (83), 6 states have call predecessors, (83), 6 states have return successors, (83), 80 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-20 08:35:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 857 transitions. [2024-11-20 08:35:01,333 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 857 transitions. Word has length 180 [2024-11-20 08:35:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:01,333 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 857 transitions. [2024-11-20 08:35:01,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 857 transitions. [2024-11-20 08:35:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:01,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:01,336 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:01,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 08:35:01,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:01,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1972040209, now seen corresponding path program 1 times [2024-11-20 08:35:01,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:01,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757428758] [2024-11-20 08:35:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757428758] [2024-11-20 08:35:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757428758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:01,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:01,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:35:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746122865] [2024-11-20 08:35:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:01,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:35:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:01,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:35:01,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:35:01,700 INFO L87 Difference]: Start difference. First operand 633 states and 857 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:01,855 INFO L93 Difference]: Finished difference Result 1450 states and 1952 transitions. [2024-11-20 08:35:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:35:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:01,860 INFO L225 Difference]: With dead ends: 1450 [2024-11-20 08:35:01,861 INFO L226 Difference]: Without dead ends: 820 [2024-11-20 08:35:01,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:35:01,864 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 35 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:01,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 745 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:35:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-20 08:35:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 653. [2024-11-20 08:35:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 563 states have (on average 1.280639431616341) internal successors, (721), 566 states have internal predecessors, (721), 83 states have call successors, (83), 6 states have call predecessors, (83), 6 states have return successors, (83), 80 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-20 08:35:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 887 transitions. [2024-11-20 08:35:01,925 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 887 transitions. Word has length 180 [2024-11-20 08:35:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:01,926 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 887 transitions. [2024-11-20 08:35:01,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 887 transitions. [2024-11-20 08:35:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:01,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:01,928 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:01,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 08:35:01,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:01,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1043063409, now seen corresponding path program 1 times [2024-11-20 08:35:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:01,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774787914] [2024-11-20 08:35:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:01,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:02,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774787914] [2024-11-20 08:35:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774787914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:35:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010689163] [2024-11-20 08:35:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:02,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:35:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:35:02,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:35:02,553 INFO L87 Difference]: Start difference. First operand 653 states and 887 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:35:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:02,896 INFO L93 Difference]: Finished difference Result 1657 states and 2231 transitions. [2024-11-20 08:35:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:35:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2024-11-20 08:35:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:02,902 INFO L225 Difference]: With dead ends: 1657 [2024-11-20 08:35:02,902 INFO L226 Difference]: Without dead ends: 1007 [2024-11-20 08:35:02,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:35:02,904 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 361 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:02,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 401 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:35:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-11-20 08:35:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 845. [2024-11-20 08:35:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 755 states have (on average 1.2781456953642385) internal successors, (965), 758 states have internal predecessors, (965), 83 states have call successors, (83), 6 states have call predecessors, (83), 6 states have return successors, (83), 80 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-20 08:35:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1131 transitions. [2024-11-20 08:35:02,978 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1131 transitions. Word has length 180 [2024-11-20 08:35:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:02,979 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1131 transitions. [2024-11-20 08:35:02,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:35:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1131 transitions. [2024-11-20 08:35:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:02,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:02,981 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:02,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 08:35:02,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1945750163, now seen corresponding path program 1 times [2024-11-20 08:35:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714201169] [2024-11-20 08:35:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:03,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:03,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714201169] [2024-11-20 08:35:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714201169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:03,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:35:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932083882] [2024-11-20 08:35:03,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:03,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:35:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:35:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:03,131 INFO L87 Difference]: Start difference. First operand 845 states and 1131 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:03,193 INFO L93 Difference]: Finished difference Result 1703 states and 2283 transitions. [2024-11-20 08:35:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:35:03,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:03,200 INFO L225 Difference]: With dead ends: 1703 [2024-11-20 08:35:03,200 INFO L226 Difference]: Without dead ends: 861 [2024-11-20 08:35:03,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:03,202 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:03,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 469 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-20 08:35:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2024-11-20 08:35:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 771 states have (on average 1.272373540856031) internal successors, (981), 774 states have internal predecessors, (981), 83 states have call successors, (83), 6 states have call predecessors, (83), 6 states have return successors, (83), 80 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-20 08:35:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1147 transitions. [2024-11-20 08:35:03,267 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1147 transitions. Word has length 180 [2024-11-20 08:35:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:03,267 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1147 transitions. [2024-11-20 08:35:03,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1147 transitions. [2024-11-20 08:35:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:03,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:03,270 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:03,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 08:35:03,270 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash -22522129, now seen corresponding path program 1 times [2024-11-20 08:35:03,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:03,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609035072] [2024-11-20 08:35:03,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:03,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609035072] [2024-11-20 08:35:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609035072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:03,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:35:03,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619890987] [2024-11-20 08:35:03,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:35:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:03,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:35:03,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:35:03,692 INFO L87 Difference]: Start difference. First operand 861 states and 1147 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:03,834 INFO L93 Difference]: Finished difference Result 1762 states and 2351 transitions. [2024-11-20 08:35:03,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:35:03,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:03,839 INFO L225 Difference]: With dead ends: 1762 [2024-11-20 08:35:03,839 INFO L226 Difference]: Without dead ends: 904 [2024-11-20 08:35:03,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:35:03,842 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 118 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:03,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 613 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:35:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-11-20 08:35:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 764. [2024-11-20 08:35:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 674 states have (on average 1.2729970326409497) internal successors, (858), 677 states have internal predecessors, (858), 83 states have call successors, (83), 6 states have call predecessors, (83), 6 states have return successors, (83), 80 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-20 08:35:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1024 transitions. [2024-11-20 08:35:03,901 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1024 transitions. Word has length 180 [2024-11-20 08:35:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:03,901 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1024 transitions. [2024-11-20 08:35:03,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1024 transitions. [2024-11-20 08:35:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:03,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:03,904 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:03,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 08:35:03,904 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:03,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1865700493, now seen corresponding path program 1 times [2024-11-20 08:35:03,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:03,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443647626] [2024-11-20 08:35:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:04,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:04,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443647626] [2024-11-20 08:35:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443647626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:04,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:04,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:35:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937854083] [2024-11-20 08:35:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:04,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:35:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:04,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:35:04,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:35:04,641 INFO L87 Difference]: Start difference. First operand 764 states and 1024 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 08:35:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:05,179 INFO L93 Difference]: Finished difference Result 1963 states and 2611 transitions. [2024-11-20 08:35:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:35:05,179 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 180 [2024-11-20 08:35:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:05,185 INFO L225 Difference]: With dead ends: 1963 [2024-11-20 08:35:05,185 INFO L226 Difference]: Without dead ends: 1202 [2024-11-20 08:35:05,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:35:05,187 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 509 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:05,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 575 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:35:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2024-11-20 08:35:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1175. [2024-11-20 08:35:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1040 states have (on average 1.2576923076923077) internal successors, (1308), 1048 states have internal predecessors, (1308), 123 states have call successors, (123), 11 states have call predecessors, (123), 11 states have return successors, (123), 115 states have call predecessors, (123), 123 states have call successors, (123) [2024-11-20 08:35:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1554 transitions. [2024-11-20 08:35:05,290 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1554 transitions. Word has length 180 [2024-11-20 08:35:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:05,291 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1554 transitions. [2024-11-20 08:35:05,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 08:35:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1554 transitions. [2024-11-20 08:35:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:05,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:05,293 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:05,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 08:35:05,294 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:05,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash 57527541, now seen corresponding path program 1 times [2024-11-20 08:35:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:05,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833017125] [2024-11-20 08:35:05,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:05,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:05,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833017125] [2024-11-20 08:35:05,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833017125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:05,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:05,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:35:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545977838] [2024-11-20 08:35:05,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:05,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:35:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:35:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:35:05,631 INFO L87 Difference]: Start difference. First operand 1175 states and 1554 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:05,828 INFO L93 Difference]: Finished difference Result 2238 states and 2959 transitions. [2024-11-20 08:35:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:35:05,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:05,835 INFO L225 Difference]: With dead ends: 2238 [2024-11-20 08:35:05,835 INFO L226 Difference]: Without dead ends: 1066 [2024-11-20 08:35:05,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:35:05,838 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 9 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:05,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 727 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:35:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2024-11-20 08:35:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2024-11-20 08:35:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 931 states have (on average 1.2438238453276047) internal successors, (1158), 939 states have internal predecessors, (1158), 123 states have call successors, (123), 11 states have call predecessors, (123), 11 states have return successors, (123), 115 states have call predecessors, (123), 123 states have call successors, (123) [2024-11-20 08:35:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1404 transitions. [2024-11-20 08:35:05,937 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1404 transitions. Word has length 180 [2024-11-20 08:35:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:05,938 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1404 transitions. [2024-11-20 08:35:05,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1404 transitions. [2024-11-20 08:35:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:05,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:05,940 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:05,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 08:35:05,940 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1363681265, now seen corresponding path program 1 times [2024-11-20 08:35:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652726861] [2024-11-20 08:35:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:06,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652726861] [2024-11-20 08:35:06,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652726861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:06,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:06,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:35:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979636862] [2024-11-20 08:35:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:06,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:35:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:35:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:35:06,545 INFO L87 Difference]: Start difference. First operand 1066 states and 1404 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:35:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:06,932 INFO L93 Difference]: Finished difference Result 2341 states and 3081 transitions. [2024-11-20 08:35:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:35:06,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2024-11-20 08:35:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:06,939 INFO L225 Difference]: With dead ends: 2341 [2024-11-20 08:35:06,940 INFO L226 Difference]: Without dead ends: 1278 [2024-11-20 08:35:06,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:35:06,942 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 354 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:06,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 515 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:35:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2024-11-20 08:35:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1056. [2024-11-20 08:35:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 921 states have (on average 1.230184581976113) internal successors, (1133), 929 states have internal predecessors, (1133), 123 states have call successors, (123), 11 states have call predecessors, (123), 11 states have return successors, (123), 115 states have call predecessors, (123), 123 states have call successors, (123) [2024-11-20 08:35:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1379 transitions. [2024-11-20 08:35:07,031 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1379 transitions. Word has length 180 [2024-11-20 08:35:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:07,032 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1379 transitions. [2024-11-20 08:35:07,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:35:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1379 transitions. [2024-11-20 08:35:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:07,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:07,034 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:07,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 08:35:07,035 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:07,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 83817587, now seen corresponding path program 1 times [2024-11-20 08:35:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:07,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426256339] [2024-11-20 08:35:07,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:07,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:07,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426256339] [2024-11-20 08:35:07,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426256339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:07,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:07,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:35:07,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971402683] [2024-11-20 08:35:07,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:07,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:35:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:07,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:35:07,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:35:07,786 INFO L87 Difference]: Start difference. First operand 1056 states and 1379 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 08:35:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:08,294 INFO L93 Difference]: Finished difference Result 2298 states and 3001 transitions. [2024-11-20 08:35:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:35:08,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 180 [2024-11-20 08:35:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:08,301 INFO L225 Difference]: With dead ends: 2298 [2024-11-20 08:35:08,302 INFO L226 Difference]: Without dead ends: 1245 [2024-11-20 08:35:08,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:35:08,305 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 218 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:08,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 781 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:35:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-11-20 08:35:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1023. [2024-11-20 08:35:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 904 states have (on average 1.2278761061946903) internal successors, (1110), 910 states have internal predecessors, (1110), 107 states have call successors, (107), 11 states have call predecessors, (107), 11 states have return successors, (107), 101 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-20 08:35:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1324 transitions. [2024-11-20 08:35:08,408 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1324 transitions. Word has length 180 [2024-11-20 08:35:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:08,409 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1324 transitions. [2024-11-20 08:35:08,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 08:35:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1324 transitions. [2024-11-20 08:35:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:08,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:08,410 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:08,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 08:35:08,411 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:08,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash -502988427, now seen corresponding path program 1 times [2024-11-20 08:35:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188356793] [2024-11-20 08:35:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:08,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:08,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188356793] [2024-11-20 08:35:08,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188356793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:08,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:08,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:35:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952515446] [2024-11-20 08:35:08,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:08,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:35:08,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:08,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:35:08,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:35:08,832 INFO L87 Difference]: Start difference. First operand 1023 states and 1324 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:08,977 INFO L93 Difference]: Finished difference Result 2229 states and 2886 transitions. [2024-11-20 08:35:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:35:08,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:08,983 INFO L225 Difference]: With dead ends: 2229 [2024-11-20 08:35:08,984 INFO L226 Difference]: Without dead ends: 1209 [2024-11-20 08:35:08,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:35:08,987 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 65 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:08,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 638 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:35:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-20 08:35:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1023. [2024-11-20 08:35:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 904 states have (on average 1.2190265486725664) internal successors, (1102), 910 states have internal predecessors, (1102), 107 states have call successors, (107), 11 states have call predecessors, (107), 11 states have return successors, (107), 101 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-20 08:35:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1316 transitions. [2024-11-20 08:35:09,074 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1316 transitions. Word has length 180 [2024-11-20 08:35:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:09,075 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1316 transitions. [2024-11-20 08:35:09,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1316 transitions. [2024-11-20 08:35:09,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:09,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:09,077 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:09,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 08:35:09,077 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:09,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash 198076151, now seen corresponding path program 1 times [2024-11-20 08:35:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085736748] [2024-11-20 08:35:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:10,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:10,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085736748] [2024-11-20 08:35:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085736748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:10,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:10,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:35:10,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721314588] [2024-11-20 08:35:10,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:10,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:35:10,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:10,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:35:10,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:35:10,348 INFO L87 Difference]: Start difference. First operand 1023 states and 1316 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:10,946 INFO L93 Difference]: Finished difference Result 2145 states and 2770 transitions. [2024-11-20 08:35:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:35:10,946 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:10,952 INFO L225 Difference]: With dead ends: 2145 [2024-11-20 08:35:10,952 INFO L226 Difference]: Without dead ends: 1125 [2024-11-20 08:35:10,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:35:10,955 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 144 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:10,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1297 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:35:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-20 08:35:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1013. [2024-11-20 08:35:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 894 states have (on average 1.221476510067114) internal successors, (1092), 900 states have internal predecessors, (1092), 107 states have call successors, (107), 11 states have call predecessors, (107), 11 states have return successors, (107), 101 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-20 08:35:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1306 transitions. [2024-11-20 08:35:11,036 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1306 transitions. Word has length 180 [2024-11-20 08:35:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:11,037 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1306 transitions. [2024-11-20 08:35:11,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1306 transitions. [2024-11-20 08:35:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:11,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:11,039 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:11,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 08:35:11,039 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:11,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1887269220, now seen corresponding path program 1 times [2024-11-20 08:35:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:11,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725043851] [2024-11-20 08:35:11,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:11,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:11,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:11,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725043851] [2024-11-20 08:35:11,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725043851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:11,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:11,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:35:11,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791212992] [2024-11-20 08:35:11,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:11,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:35:11,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:11,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:35:11,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:11,271 INFO L87 Difference]: Start difference. First operand 1013 states and 1306 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:11,502 INFO L93 Difference]: Finished difference Result 2277 states and 2921 transitions. [2024-11-20 08:35:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:35:11,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:11,508 INFO L225 Difference]: With dead ends: 2277 [2024-11-20 08:35:11,508 INFO L226 Difference]: Without dead ends: 1267 [2024-11-20 08:35:11,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-11-20 08:35:11,511 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 114 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:11,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 431 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:35:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-20 08:35:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1078. [2024-11-20 08:35:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 934 states have (on average 1.215203426124197) internal successors, (1135), 940 states have internal predecessors, (1135), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-20 08:35:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1395 transitions. [2024-11-20 08:35:11,609 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1395 transitions. Word has length 180 [2024-11-20 08:35:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:11,610 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1395 transitions. [2024-11-20 08:35:11,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1395 transitions. [2024-11-20 08:35:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-20 08:35:11,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:11,611 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:11,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 08:35:11,611 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:11,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash 146621974, now seen corresponding path program 1 times [2024-11-20 08:35:11,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:11,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738520526] [2024-11-20 08:35:11,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:11,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:11,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:11,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738520526] [2024-11-20 08:35:11,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738520526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:11,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:11,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:35:11,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784810269] [2024-11-20 08:35:11,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:11,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:35:11,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:35:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:35:11,800 INFO L87 Difference]: Start difference. First operand 1078 states and 1395 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:11,899 INFO L93 Difference]: Finished difference Result 2112 states and 2730 transitions. [2024-11-20 08:35:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:35:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2024-11-20 08:35:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:11,905 INFO L225 Difference]: With dead ends: 2112 [2024-11-20 08:35:11,905 INFO L226 Difference]: Without dead ends: 1102 [2024-11-20 08:35:11,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:35:11,907 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:11,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-20 08:35:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2024-11-20 08:35:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 958 states have (on average 1.209812108559499) internal successors, (1159), 964 states have internal predecessors, (1159), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-20 08:35:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1419 transitions. [2024-11-20 08:35:12,027 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1419 transitions. Word has length 182 [2024-11-20 08:35:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:12,028 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1419 transitions. [2024-11-20 08:35:12,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1419 transitions. [2024-11-20 08:35:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-20 08:35:12,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:12,029 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:12,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 08:35:12,029 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:12,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash -462521391, now seen corresponding path program 1 times [2024-11-20 08:35:12,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:12,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225727257] [2024-11-20 08:35:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:35:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:35:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:35:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:35:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:35:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:35:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:35:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:35:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 08:35:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 08:35:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:12,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:12,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225727257] [2024-11-20 08:35:12,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225727257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:12,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:35:12,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93121413] [2024-11-20 08:35:12,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:12,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:35:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:35:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:35:12,661 INFO L87 Difference]: Start difference. First operand 1102 states and 1419 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-20 08:35:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:13,107 INFO L93 Difference]: Finished difference Result 1341 states and 1722 transitions. [2024-11-20 08:35:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:35:13,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 184 [2024-11-20 08:35:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:13,116 INFO L225 Difference]: With dead ends: 1341 [2024-11-20 08:35:13,117 INFO L226 Difference]: Without dead ends: 1339 [2024-11-20 08:35:13,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:35:13,118 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 237 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:13,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1062 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:35:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-11-20 08:35:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1282. [2024-11-20 08:35:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1138 states have (on average 1.2082601054481548) internal successors, (1375), 1144 states have internal predecessors, (1375), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-20 08:35:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1635 transitions. [2024-11-20 08:35:13,220 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1635 transitions. Word has length 184 [2024-11-20 08:35:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:13,221 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1635 transitions. [2024-11-20 08:35:13,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-20 08:35:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1635 transitions. [2024-11-20 08:35:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-20 08:35:13,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:13,222 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:13,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 08:35:13,223 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:13,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1306526893, now seen corresponding path program 1 times [2024-11-20 08:35:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:13,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212351886] [2024-11-20 08:35:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:35:13,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:35:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:35:13,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:35:13,525 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:35:13,526 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:35:13,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 08:35:13,531 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:13,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:35:13,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:35:13 BoogieIcfgContainer [2024-11-20 08:35:13,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:35:13,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:35:13,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:35:13,733 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:35:13,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:34:51" (3/4) ... [2024-11-20 08:35:13,736 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:35:13,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:35:13,738 INFO L158 Benchmark]: Toolchain (without parser) took 23983.88ms. Allocated memory was 174.1MB in the beginning and 704.6MB in the end (delta: 530.6MB). Free memory was 104.6MB in the beginning and 414.6MB in the end (delta: -310.1MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2024-11-20 08:35:13,738 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:35:13,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.15ms. Allocated memory is still 174.1MB. Free memory was 104.6MB in the beginning and 87.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 08:35:13,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.97ms. Allocated memory is still 174.1MB. Free memory was 87.7MB in the beginning and 83.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:35:13,739 INFO L158 Benchmark]: Boogie Preprocessor took 79.05ms. Allocated memory is still 174.1MB. Free memory was 83.6MB in the beginning and 78.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:35:13,739 INFO L158 Benchmark]: RCFGBuilder took 837.61ms. Allocated memory is still 174.1MB. Free memory was 78.9MB in the beginning and 134.3MB in the end (delta: -55.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-20 08:35:13,740 INFO L158 Benchmark]: TraceAbstraction took 22585.48ms. Allocated memory was 174.1MB in the beginning and 704.6MB in the end (delta: 530.6MB). Free memory was 133.4MB in the beginning and 414.6MB in the end (delta: -281.3MB). Peak memory consumption was 251.1MB. Max. memory is 16.1GB. [2024-11-20 08:35:13,740 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 704.6MB. Free memory is still 414.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:35:13,742 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.15ms. Allocated memory is still 174.1MB. Free memory was 104.6MB in the beginning and 87.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.97ms. Allocated memory is still 174.1MB. Free memory was 87.7MB in the beginning and 83.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.05ms. Allocated memory is still 174.1MB. Free memory was 83.6MB in the beginning and 78.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 837.61ms. Allocated memory is still 174.1MB. Free memory was 78.9MB in the beginning and 134.3MB in the end (delta: -55.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22585.48ms. Allocated memory was 174.1MB in the beginning and 704.6MB in the end (delta: 530.6MB). Free memory was 133.4MB in the beginning and 414.6MB in the end (delta: -281.3MB). Peak memory consumption was 251.1MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 704.6MB. Free memory is still 414.6MB. 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 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0][0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1][0]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[0][1]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[1][1]); [L29] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer = &(BOOL_unsigned_char_Array_0[0][2]); [L30] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer = &(BOOL_unsigned_char_Array_0[1][2]); [L31-L33] double double_Array_0[2] = { 10.6, 16.6 }; [L31-L33] double double_Array_0[2] = { 10.6, 16.6 }; [L31-L33] double double_Array_0[2] = { 10.6, 16.6 }; [L34] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L35] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L36-L38] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L40] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L41] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[2]); [L42] signed char* signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer = &(signed_char_Array_0[3]); [L43] signed char* signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer = &(signed_char_Array_0[4]); [L44-L46] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L44-L46] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L44-L46] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L44-L46] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L48] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L49] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[2]); [L50] unsigned char last_1_BOOL_unsigned_char_Array_0_1__1_ = 0; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L115] EXPR BOOL_unsigned_char_Array_0[1][1] [L115] last_1_BOOL_unsigned_char_Array_0_1__1_ = BOOL_unsigned_char_Array_0[1][1] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L78] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L80] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L81] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L82] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L83] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L84] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L86] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L87] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L89] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L90] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L91] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L91] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L91] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L92] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L93] double_Array_0[0] = __VERIFIER_nondet_double() [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L94] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L95] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L96] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L96] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L96] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L97] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L97] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L97] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L98] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L99] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L99] CALL assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L99] RET assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L100] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L100] CALL assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L100] RET assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L101] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L102] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L102] CALL assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L102] RET assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L103] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L103] CALL assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L103] RET assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L104] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L106] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L107] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L108] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L108] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L108] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L109] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L109] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L109] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L110] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L111] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L111] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L111] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L112] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L112] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L112] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L126] RET updateVariables() [L127] CALL step() [L54] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L59] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L59] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L59] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L59] COND FALSE !((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) [L62] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L62] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L62] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L62] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) [L63] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer) [L63] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L63] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L63] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L63] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L63] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) = (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L67] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L67] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L67] signed long int stepLocal_1 = ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1))); [L68] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L68] signed char stepLocal_0 = (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)); [L69] COND FALSE !(-10 >= stepLocal_0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1 [L118] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))))))) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1 [L118] EXPR (-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1)) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1)) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1 [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer) [L118] EXPR ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1)) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L118-L119] return (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))))) : 1) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (256 >= ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) + 4))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (! ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))))))) && ((-10 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < (1)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : (1)))) > (~ (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) : 1)) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) >= (- ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) * (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) : 1) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 26, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4168 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4168 mSDsluCounter, 15603 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11307 mSDsCounter, 995 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3250 IncrementalHoareTripleChecker+Invalid, 4245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 995 mSolverCounterUnsat, 4296 mSDtfsCounter, 3250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1405 GetRequests, 1228 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1282occurred in iteration=25, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 1852 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 4634 NumberOfCodeBlocks, 4634 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4425 ConstructedInterpolants, 0 QuantifiedInterpolants, 13243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 25300/25300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:35:13,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efbce6a3c3cc86de2fbc1d4647db693e04b33292f9edfaeea674d0c6a2cba64f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:35:16,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:35:16,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:35:16,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:35:16,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:35:16,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:35:16,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:35:16,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:35:16,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:35:16,246 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:35:16,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:35:16,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:35:16,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:35:16,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:35:16,249 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:35:16,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:35:16,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:35:16,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:35:16,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:35:16,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:35:16,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:35:16,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:35:16,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:35:16,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:35:16,256 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:35:16,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:35:16,256 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:35:16,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:35:16,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:35:16,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:35:16,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:35:16,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:35:16,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:35:16,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:35:16,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:35:16,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:35:16,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:35:16,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:35:16,261 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:35:16,261 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:35:16,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:35:16,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:35:16,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:35:16,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:35:16,263 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efbce6a3c3cc86de2fbc1d4647db693e04b33292f9edfaeea674d0c6a2cba64f [2024-11-20 08:35:16,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:35:16,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:35:16,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:35:16,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:35:16,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:35:16,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i [2024-11-20 08:35:18,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:35:18,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:35:18,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i [2024-11-20 08:35:18,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe36786f/ecbc4ff826e54737a5c57bf430679618/FLAG64cde40bb [2024-11-20 08:35:18,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe36786f/ecbc4ff826e54737a5c57bf430679618 [2024-11-20 08:35:18,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:35:18,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:35:18,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:35:18,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:35:18,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:35:18,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:35:18" (1/1) ... [2024-11-20 08:35:18,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8a2edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:18, skipping insertion in model container [2024-11-20 08:35:18,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:35:18" (1/1) ... [2024-11-20 08:35:18,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:35:19,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i[917,930] [2024-11-20 08:35:19,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:35:19,158 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:35:19,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-34.i[917,930] [2024-11-20 08:35:19,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:35:19,238 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:35:19,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19 WrapperNode [2024-11-20 08:35:19,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:35:19,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:35:19,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:35:19,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:35:19,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,298 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2024-11-20 08:35:19,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:35:19,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:35:19,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:35:19,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:35:19,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,340 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2024-11-20 08:35:19,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:35:19,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:35:19,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:35:19,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:35:19,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (1/1) ... [2024-11-20 08:35:19,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:35:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:35:19,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:35:19,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:35:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:35:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-20 08:35:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-20 08:35:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-20 08:35:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 08:35:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-20 08:35:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:35:19,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:35:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:35:19,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:35:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:35:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:35:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 08:35:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 08:35:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 08:35:19,624 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:35:19,627 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:35:30,167 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-20 08:35:30,167 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:35:30,189 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:35:30,189 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:35:30,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:35:30 BoogieIcfgContainer [2024-11-20 08:35:30,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:35:30,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:35:30,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:35:30,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:35:30,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:35:18" (1/3) ... [2024-11-20 08:35:30,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d0391a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:35:30, skipping insertion in model container [2024-11-20 08:35:30,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:19" (2/3) ... [2024-11-20 08:35:30,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d0391a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:35:30, skipping insertion in model container [2024-11-20 08:35:30,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:35:30" (3/3) ... [2024-11-20 08:35:30,198 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-34.i [2024-11-20 08:35:30,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:35:30,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:35:30,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:35:30,311 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;@48a8c569, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:35:30,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:35:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:35:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:35:30,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:30,331 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:30,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:30,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1263040471, now seen corresponding path program 1 times [2024-11-20 08:35:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:30,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731740131] [2024-11-20 08:35:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:30,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-11-20 08:35:30,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:30,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:30,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:35:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:30,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:35:30,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-20 08:35:30,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:30,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:30,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731740131] [2024-11-20 08:35:30,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731740131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:30,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:30,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:35:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117409780] [2024-11-20 08:35:30,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:35:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:30,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:35:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:35:30,951 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:35:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:30,994 INFO L93 Difference]: Finished difference Result 233 states and 367 transitions. [2024-11-20 08:35:30,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:35:30,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-20 08:35:30,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:31,009 INFO L225 Difference]: With dead ends: 233 [2024-11-20 08:35:31,009 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 08:35:31,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:35:31,022 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:31,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 08:35:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-20 08:35:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:35:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-20 08:35:31,073 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2024-11-20 08:35:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:31,073 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-20 08:35:31,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:35:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-20 08:35:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:35:31,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:31,078 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:31,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 08:35:31,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:31,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:31,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1556431919, now seen corresponding path program 1 times [2024-11-20 08:35:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:31,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482111002] [2024-11-20 08:35:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:31,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:31,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:31,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:31,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 08:35:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:31,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:35:31,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-20 08:35:31,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:31,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:31,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482111002] [2024-11-20 08:35:31,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482111002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:31,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:31,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:35:31,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496086863] [2024-11-20 08:35:31,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:31,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:35:31,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:31,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:35:31,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:31,863 INFO L87 Difference]: Start difference. First operand 116 states and 168 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:35:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:31,990 INFO L93 Difference]: Finished difference Result 231 states and 336 transitions. [2024-11-20 08:35:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:35:31,990 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-20 08:35:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:31,992 INFO L225 Difference]: With dead ends: 231 [2024-11-20 08:35:31,992 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 08:35:31,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:31,995 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:31,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:35:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 08:35:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-20 08:35:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:35:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-20 08:35:32,008 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 171 [2024-11-20 08:35:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:32,010 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-20 08:35:32,010 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 08:35:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-20 08:35:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:35:32,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:32,015 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:32,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 08:35:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:32,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2115253775, now seen corresponding path program 1 times [2024-11-20 08:35:32,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:32,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382196886] [2024-11-20 08:35:32,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:32,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:32,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:32,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:32,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 08:35:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:32,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 08:35:32,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:32,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:32,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382196886] [2024-11-20 08:35:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382196886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:32,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:35:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140384467] [2024-11-20 08:35:32,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:32,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:35:32,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:32,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:35:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:32,811 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:32,856 INFO L93 Difference]: Finished difference Result 231 states and 334 transitions. [2024-11-20 08:35:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:35:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-11-20 08:35:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:32,864 INFO L225 Difference]: With dead ends: 231 [2024-11-20 08:35:32,866 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 08:35:32,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:32,869 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:32,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 08:35:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-20 08:35:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:35:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-20 08:35:32,896 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 171 [2024-11-20 08:35:32,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:32,898 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-20 08:35:32,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-20 08:35:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 08:35:32,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:32,905 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:32,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 08:35:33,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:33,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:33,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:33,107 INFO L85 PathProgramCache]: Analyzing trace with hash 122928453, now seen corresponding path program 1 times [2024-11-20 08:35:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:33,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029513813] [2024-11-20 08:35:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:33,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:33,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:33,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:33,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 08:35:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:33,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:35:33,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:33,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:33,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:33,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029513813] [2024-11-20 08:35:33,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029513813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:33,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:33,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:35:33,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891129973] [2024-11-20 08:35:33,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:33,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:35:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:33,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:35:33,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:33,617 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:33,695 INFO L93 Difference]: Finished difference Result 231 states and 332 transitions. [2024-11-20 08:35:33,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:35:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-11-20 08:35:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:33,697 INFO L225 Difference]: With dead ends: 231 [2024-11-20 08:35:33,697 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 08:35:33,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:33,699 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:33,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:35:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 08:35:33,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-20 08:35:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 08:35:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-20 08:35:33,709 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 173 [2024-11-20 08:35:33,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:33,710 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-20 08:35:33,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-20 08:35:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 08:35:33,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:33,712 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:33,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 08:35:33,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:33,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:33,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1208001257, now seen corresponding path program 1 times [2024-11-20 08:35:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:33,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746280911] [2024-11-20 08:35:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:33,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:33,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:33,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:33,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 08:35:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:34,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:35:34,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:34,449 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 21 treesize of output 9 [2024-11-20 08:35:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:35,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:35,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:35,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746280911] [2024-11-20 08:35:35,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746280911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:35,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:35,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:35:35,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272653999] [2024-11-20 08:35:35,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:35,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:35:35,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:35,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:35:35,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:35,640 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:36,116 INFO L93 Difference]: Finished difference Result 350 states and 500 transitions. [2024-11-20 08:35:36,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:35:36,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-11-20 08:35:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:36,120 INFO L225 Difference]: With dead ends: 350 [2024-11-20 08:35:36,120 INFO L226 Difference]: Without dead ends: 235 [2024-11-20 08:35:36,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 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-11-20 08:35:36,121 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 107 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:36,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 436 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:35:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-20 08:35:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 195. [2024-11-20 08:35:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 146 states have internal predecessors, (185), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 08:35:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2024-11-20 08:35:36,142 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 175 [2024-11-20 08:35:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:36,143 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2024-11-20 08:35:36,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2024-11-20 08:35:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 08:35:36,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:36,145 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:36,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 08:35:36,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:36,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:36,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:36,347 INFO L85 PathProgramCache]: Analyzing trace with hash 432539007, now seen corresponding path program 1 times [2024-11-20 08:35:36,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:36,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033780247] [2024-11-20 08:35:36,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:36,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-11-20 08:35:36,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:36,351 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:36,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 08:35:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:36,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 08:35:36,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:36,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:36,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:36,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033780247] [2024-11-20 08:35:36,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033780247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:36,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:36,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:35:36,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323990868] [2024-11-20 08:35:36,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:36,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:35:36,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:36,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:35:36,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:36,802 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:36,850 INFO L93 Difference]: Finished difference Result 324 states and 462 transitions. [2024-11-20 08:35:36,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:35:36,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2024-11-20 08:35:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:36,853 INFO L225 Difference]: With dead ends: 324 [2024-11-20 08:35:36,854 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 08:35:36,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:36,855 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:36,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 08:35:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-20 08:35:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 144 states have internal predecessors, (181), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 08:35:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2024-11-20 08:35:36,876 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 178 [2024-11-20 08:35:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:36,877 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2024-11-20 08:35:36,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2024-11-20 08:35:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:36,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:36,879 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:36,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 08:35:37,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:37,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:37,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2086298773, now seen corresponding path program 1 times [2024-11-20 08:35:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663739832] [2024-11-20 08:35:37,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:37,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:37,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:37,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 08:35:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:37,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 08:35:37,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:37,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-20 08:35:37,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-20 08:35:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:38,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:38,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:38,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663739832] [2024-11-20 08:35:38,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663739832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:38,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:38,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:35:38,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495495290] [2024-11-20 08:35:38,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:38,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:35:38,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:38,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:35:38,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:35:38,078 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:38,722 INFO L93 Difference]: Finished difference Result 383 states and 541 transitions. [2024-11-20 08:35:38,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:35:38,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:38,725 INFO L225 Difference]: With dead ends: 383 [2024-11-20 08:35:38,725 INFO L226 Difference]: Without dead ends: 254 [2024-11-20 08:35:38,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:35:38,731 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 56 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:38,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1289 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:35:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-20 08:35:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2024-11-20 08:35:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 183 states have (on average 1.273224043715847) internal successors, (233), 183 states have internal predecessors, (233), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 08:35:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 325 transitions. [2024-11-20 08:35:38,763 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 325 transitions. Word has length 180 [2024-11-20 08:35:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:38,764 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 325 transitions. [2024-11-20 08:35:38,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 325 transitions. [2024-11-20 08:35:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:38,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:38,767 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:38,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 08:35:38,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:38,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:38,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1972040209, now seen corresponding path program 1 times [2024-11-20 08:35:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501527162] [2024-11-20 08:35:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:38,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:38,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:38,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:38,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 08:35:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 08:35:39,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 08:35:39,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:39,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501527162] [2024-11-20 08:35:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501527162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:39,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:39,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:35:39,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113848972] [2024-11-20 08:35:39,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:39,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:35:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:39,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:35:39,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:35:39,569 INFO L87 Difference]: Start difference. First operand 232 states and 325 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:40,009 INFO L93 Difference]: Finished difference Result 439 states and 611 transitions. [2024-11-20 08:35:40,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:35:40,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-20 08:35:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:40,012 INFO L225 Difference]: With dead ends: 439 [2024-11-20 08:35:40,012 INFO L226 Difference]: Without dead ends: 271 [2024-11-20 08:35:40,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:35:40,014 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 36 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:40,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 754 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:35:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-20 08:35:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 238. [2024-11-20 08:35:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 189 states have (on average 1.2751322751322751) internal successors, (241), 189 states have internal predecessors, (241), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 08:35:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 333 transitions. [2024-11-20 08:35:40,029 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 333 transitions. Word has length 180 [2024-11-20 08:35:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:40,030 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 333 transitions. [2024-11-20 08:35:40,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 08:35:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 333 transitions. [2024-11-20 08:35:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 08:35:40,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:40,033 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:40,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 08:35:40,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:40,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:40,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1043063409, now seen corresponding path program 1 times [2024-11-20 08:35:40,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:40,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833259923] [2024-11-20 08:35:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:40,237 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:40,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 08:35:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 08:35:40,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:42,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 08:35:43,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-20 08:35:47,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:35:47,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-20 08:35:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 480 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-11-20 08:35:48,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:35:48,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:48,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833259923] [2024-11-20 08:35:48,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833259923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:35:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1024697629] [2024-11-20 08:35:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:48,762 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:35:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:35:48,763 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:35:48,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-20 08:35:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 08:35:49,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:51,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 08:35:52,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-20 08:35:55,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-20 08:35:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-11-20 08:35:55,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:35:55,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1024697629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:35:55,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:35:55,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2024-11-20 08:35:55,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235125449] [2024-11-20 08:35:55,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:35:55,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 08:35:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:55,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 08:35:55,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-20 08:35:55,837 INFO L87 Difference]: Start difference. First operand 238 states and 333 transitions. Second operand has 17 states, 16 states have (on average 8.125) internal successors, (130), 15 states have internal predecessors, (130), 5 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (46), 5 states have call predecessors, (46), 5 states have call successors, (46)