./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-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-4.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 ebe3d6e9d03e6e5cf83180cae6564bdb73d3d5ae307bc763d1d081898bce00b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:26:43,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:26:43,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:26:43,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:26:43,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:26:43,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:26:43,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:26:43,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:26:43,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:26:43,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:26:43,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:26:43,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:26:43,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:26:43,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:26:43,112 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:26:43,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:26:43,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:26:43,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:26:43,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:26:43,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:26:43,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:26:43,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:26:43,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:26:43,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:26:43,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:26:43,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:26:43,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:26:43,118 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:26:43,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:26:43,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:26:43,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:26:43,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:26:43,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:26:43,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:26:43,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:26:43,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:26:43,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:26:43,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:26:43,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:26:43,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:26:43,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:26:43,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:26:43,124 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 -> ebe3d6e9d03e6e5cf83180cae6564bdb73d3d5ae307bc763d1d081898bce00b0 [2024-10-24 11:26:43,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:26:43,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:26:43,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:26:43,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:26:43,405 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:26:43,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-4.i [2024-10-24 11:26:44,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:26:45,104 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:26:45,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-4.i [2024-10-24 11:26:45,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bab0c81e/39831a675cf84bd18c92fc0e2b490ec2/FLAGee6007f29 [2024-10-24 11:26:45,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bab0c81e/39831a675cf84bd18c92fc0e2b490ec2 [2024-10-24 11:26:45,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:26:45,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:26:45,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:26:45,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:26:45,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:26:45,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f966a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45, skipping insertion in model container [2024-10-24 11:26:45,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:26:45,350 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-4.i[916,929] [2024-10-24 11:26:45,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:26:45,457 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:26:45,469 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-4.i[916,929] [2024-10-24 11:26:45,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:26:45,526 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:26:45,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45 WrapperNode [2024-10-24 11:26:45,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:26:45,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:26:45,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:26:45,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:26:45,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,588 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 509 [2024-10-24 11:26:45,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:26:45,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:26:45,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:26:45,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:26:45,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,640 INFO L175 MemorySlicer]: Split 130 memory accesses to 6 slices as follows [2, 38, 11, 55, 12, 12]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 4, 1, 4, 2, 2]. The 15 writes are split as follows [0, 4, 1, 5, 3, 2]. [2024-10-24 11:26:45,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:26:45,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:26:45,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:26:45,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:26:45,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (1/1) ... [2024-10-24 11:26:45,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:26:45,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:26:45,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:26:45,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:26:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:26:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:26:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:26:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:26:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:26:45,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:26:45,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:26:45,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:26:45,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:26:45,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:26:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:26:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:26:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:26:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:26:45,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:26:45,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:26:45,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:26:45,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:26:45,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:26:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:26:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:26:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:26:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:26:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:26:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:26:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:26:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:26:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:26:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:26:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:26:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:26:45,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:26:45,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:26:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:26:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:26:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:26:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:26:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:26:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:26:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:26:45,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:26:45,941 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:26:45,945 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:26:46,488 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-10-24 11:26:46,488 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:26:46,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:26:46,525 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:26:46,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:26:46 BoogieIcfgContainer [2024-10-24 11:26:46,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:26:46,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:26:46,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:26:46,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:26:46,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:26:45" (1/3) ... [2024-10-24 11:26:46,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c692030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:26:46, skipping insertion in model container [2024-10-24 11:26:46,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:26:45" (2/3) ... [2024-10-24 11:26:46,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c692030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:26:46, skipping insertion in model container [2024-10-24 11:26:46,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:26:46" (3/3) ... [2024-10-24 11:26:46,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-4.i [2024-10-24 11:26:46,591 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:26:46,592 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:26:46,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:26:46,674 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;@10e0da96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:26:46,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:26:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 11:26:46,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:46,695 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:46,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:46,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1892406710, now seen corresponding path program 1 times [2024-10-24 11:26:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:46,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585868960] [2024-10-24 11:26:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:47,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:47,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585868960] [2024-10-24 11:26:47,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585868960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:47,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:47,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:26:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57229273] [2024-10-24 11:26:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:47,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:26:47,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:47,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:26:47,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:26:47,242 INFO L87 Difference]: Start difference. First operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:47,295 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2024-10-24 11:26:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:26:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2024-10-24 11:26:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:47,306 INFO L225 Difference]: With dead ends: 203 [2024-10-24 11:26:47,306 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 11:26:47,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:26:47,317 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:47,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:26:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 11:26:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 11:26:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 149 transitions. [2024-10-24 11:26:47,360 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 149 transitions. Word has length 125 [2024-10-24 11:26:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:47,361 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 149 transitions. [2024-10-24 11:26:47,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 149 transitions. [2024-10-24 11:26:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 11:26:47,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:47,365 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:47,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:26:47,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:47,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:47,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1204214304, now seen corresponding path program 1 times [2024-10-24 11:26:47,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:47,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844795144] [2024-10-24 11:26:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:47,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844795144] [2024-10-24 11:26:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844795144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:47,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:47,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:26:47,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760639719] [2024-10-24 11:26:47,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:47,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:26:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:26:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:26:47,717 INFO L87 Difference]: Start difference. First operand 101 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:47,838 INFO L93 Difference]: Finished difference Result 203 states and 300 transitions. [2024-10-24 11:26:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:26:47,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2024-10-24 11:26:47,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:47,842 INFO L225 Difference]: With dead ends: 203 [2024-10-24 11:26:47,842 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:26:47,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:26:47,844 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:47,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:26:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:26:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 11:26:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-10-24 11:26:47,857 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 125 [2024-10-24 11:26:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:47,858 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-10-24 11:26:47,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-10-24 11:26:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 11:26:47,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:47,860 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:47,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:26:47,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:47,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1213689762, now seen corresponding path program 1 times [2024-10-24 11:26:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695573367] [2024-10-24 11:26:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:48,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:48,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695573367] [2024-10-24 11:26:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695573367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:48,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:48,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:26:48,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693217488] [2024-10-24 11:26:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:48,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:26:48,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:48,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:26:48,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:26:48,107 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:48,149 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2024-10-24 11:26:48,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:26:48,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-10-24 11:26:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:48,154 INFO L225 Difference]: With dead ends: 208 [2024-10-24 11:26:48,154 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:26:48,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:26:48,156 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:48,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:26:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:26:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-24 11:26:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 88 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-10-24 11:26:48,171 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 125 [2024-10-24 11:26:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:48,172 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-10-24 11:26:48,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-10-24 11:26:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 11:26:48,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:48,176 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:48,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:26:48,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:48,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1213749344, now seen corresponding path program 1 times [2024-10-24 11:26:48,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:48,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463505507] [2024-10-24 11:26:48,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:48,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:48,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:49,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463505507] [2024-10-24 11:26:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463505507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:49,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:49,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:26:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863037611] [2024-10-24 11:26:49,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:49,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:26:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:26:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:26:49,017 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:49,322 INFO L93 Difference]: Finished difference Result 288 states and 418 transitions. [2024-10-24 11:26:49,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:26:49,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-10-24 11:26:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:49,325 INFO L225 Difference]: With dead ends: 288 [2024-10-24 11:26:49,325 INFO L226 Difference]: Without dead ends: 184 [2024-10-24 11:26:49,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:26:49,328 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 109 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:49,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 788 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:26:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-24 11:26:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2024-10-24 11:26:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 154 states have (on average 1.396103896103896) internal successors, (215), 155 states have internal predecessors, (215), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:26:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 263 transitions. [2024-10-24 11:26:49,344 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 263 transitions. Word has length 125 [2024-10-24 11:26:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:49,344 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 263 transitions. [2024-10-24 11:26:49,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 263 transitions. [2024-10-24 11:26:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 11:26:49,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:49,347 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:49,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:26:49,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:49,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash 820722334, now seen corresponding path program 1 times [2024-10-24 11:26:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024913540] [2024-10-24 11:26:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024913540] [2024-10-24 11:26:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024913540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:49,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:26:49,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822103439] [2024-10-24 11:26:49,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:49,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:26:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:49,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:26:49,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:26:49,565 INFO L87 Difference]: Start difference. First operand 181 states and 263 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:49,610 INFO L93 Difference]: Finished difference Result 365 states and 531 transitions. [2024-10-24 11:26:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:26:49,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-10-24 11:26:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:49,613 INFO L225 Difference]: With dead ends: 365 [2024-10-24 11:26:49,614 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 11:26:49,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:26:49,616 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:49,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:26:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 11:26:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-24 11:26:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 158 states have (on average 1.3860759493670887) internal successors, (219), 159 states have internal predecessors, (219), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:26:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 267 transitions. [2024-10-24 11:26:49,629 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 267 transitions. Word has length 125 [2024-10-24 11:26:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:49,629 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 267 transitions. [2024-10-24 11:26:49,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 267 transitions. [2024-10-24 11:26:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:26:49,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:49,631 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:49,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:26:49,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:49,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash 249061196, now seen corresponding path program 1 times [2024-10-24 11:26:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307493663] [2024-10-24 11:26:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:49,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:49,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307493663] [2024-10-24 11:26:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307493663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:49,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:49,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:26:49,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113057983] [2024-10-24 11:26:49,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:49,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:26:49,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:49,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:26:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:26:49,882 INFO L87 Difference]: Start difference. First operand 185 states and 267 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:49,931 INFO L93 Difference]: Finished difference Result 375 states and 541 transitions. [2024-10-24 11:26:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:26:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-10-24 11:26:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:49,935 INFO L225 Difference]: With dead ends: 375 [2024-10-24 11:26:49,935 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 11:26:49,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:26:49,938 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:49,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 560 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:26:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 11:26:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2024-10-24 11:26:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 160 states have (on average 1.38125) internal successors, (221), 161 states have internal predecessors, (221), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:26:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 269 transitions. [2024-10-24 11:26:49,960 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 269 transitions. Word has length 127 [2024-10-24 11:26:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:49,960 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 269 transitions. [2024-10-24 11:26:49,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 269 transitions. [2024-10-24 11:26:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:26:49,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:49,963 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:49,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:26:49,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:49,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1131881341, now seen corresponding path program 1 times [2024-10-24 11:26:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:49,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049573902] [2024-10-24 11:26:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:51,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049573902] [2024-10-24 11:26:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049573902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:51,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:51,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:26:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724221816] [2024-10-24 11:26:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:51,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:26:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:51,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:26:51,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:26:51,370 INFO L87 Difference]: Start difference. First operand 187 states and 269 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:52,202 INFO L93 Difference]: Finished difference Result 588 states and 845 transitions. [2024-10-24 11:26:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:26:52,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-10-24 11:26:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:52,207 INFO L225 Difference]: With dead ends: 588 [2024-10-24 11:26:52,207 INFO L226 Difference]: Without dead ends: 402 [2024-10-24 11:26:52,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:26:52,209 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 554 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:52,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 697 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:26:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-24 11:26:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 209. [2024-10-24 11:26:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.3846153846153846) internal successors, (252), 183 states have internal predecessors, (252), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:26:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 300 transitions. [2024-10-24 11:26:52,238 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 300 transitions. Word has length 128 [2024-10-24 11:26:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:52,238 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 300 transitions. [2024-10-24 11:26:52,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 300 transitions. [2024-10-24 11:26:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:26:52,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:52,240 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:52,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:26:52,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:52,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1883222277, now seen corresponding path program 1 times [2024-10-24 11:26:52,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:52,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873502821] [2024-10-24 11:26:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:53,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873502821] [2024-10-24 11:26:53,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873502821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:53,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:26:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163604980] [2024-10-24 11:26:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:53,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:26:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:26:53,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:26:53,175 INFO L87 Difference]: Start difference. First operand 209 states and 300 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:53,586 INFO L93 Difference]: Finished difference Result 470 states and 673 transitions. [2024-10-24 11:26:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:26:53,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-24 11:26:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:53,589 INFO L225 Difference]: With dead ends: 470 [2024-10-24 11:26:53,589 INFO L226 Difference]: Without dead ends: 262 [2024-10-24 11:26:53,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:26:53,593 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 207 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:53,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 749 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:26:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-24 11:26:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 124. [2024-10-24 11:26:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-10-24 11:26:53,613 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 128 [2024-10-24 11:26:53,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:53,614 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-10-24 11:26:53,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:26:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-10-24 11:26:53,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:26:53,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:53,617 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:53,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:26:53,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:53,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:53,618 INFO L85 PathProgramCache]: Analyzing trace with hash 792761383, now seen corresponding path program 1 times [2024-10-24 11:26:53,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:53,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49633388] [2024-10-24 11:26:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49633388] [2024-10-24 11:26:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49633388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:54,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:54,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:26:54,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533022935] [2024-10-24 11:26:54,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:26:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:54,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:26:54,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:26:54,634 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:55,345 INFO L93 Difference]: Finished difference Result 375 states and 532 transitions. [2024-10-24 11:26:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:26:55,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:26:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:55,347 INFO L225 Difference]: With dead ends: 375 [2024-10-24 11:26:55,347 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 11:26:55,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:26:55,349 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 548 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:55,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 747 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:26:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 11:26:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 129. [2024-10-24 11:26:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 111 states have internal predecessors, (153), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:26:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2024-10-24 11:26:55,368 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 129 [2024-10-24 11:26:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:55,368 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2024-10-24 11:26:55,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2024-10-24 11:26:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:26:55,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:55,370 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:55,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:26:55,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:55,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:55,371 INFO L85 PathProgramCache]: Analyzing trace with hash -218355867, now seen corresponding path program 1 times [2024-10-24 11:26:55,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:55,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403753203] [2024-10-24 11:26:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:55,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:56,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:56,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403753203] [2024-10-24 11:26:56,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403753203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:56,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:56,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:26:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605451172] [2024-10-24 11:26:56,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:56,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:26:56,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:56,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:26:56,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:26:56,752 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:26:57,364 INFO L93 Difference]: Finished difference Result 326 states and 461 transitions. [2024-10-24 11:26:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:26:57,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:26:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:26:57,366 INFO L225 Difference]: With dead ends: 326 [2024-10-24 11:26:57,366 INFO L226 Difference]: Without dead ends: 198 [2024-10-24 11:26:57,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:26:57,367 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 345 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:26:57,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 776 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:26:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-24 11:26:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 193. [2024-10-24 11:26:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 168 states have (on average 1.375) internal successors, (231), 169 states have internal predecessors, (231), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:26:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2024-10-24 11:26:57,392 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 129 [2024-10-24 11:26:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:26:57,393 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2024-10-24 11:26:57,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:26:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2024-10-24 11:26:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:26:57,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:26:57,394 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:26:57,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:26:57,396 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:26:57,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:26:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash -199679383, now seen corresponding path program 1 times [2024-10-24 11:26:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:26:57,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079890747] [2024-10-24 11:26:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:26:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:26:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:26:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:26:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:26:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:26:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:26:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:26:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:26:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:26:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:26:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:26:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:26:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:26:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:26:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:26:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:26:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:26:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:26:59,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:26:59,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079890747] [2024-10-24 11:26:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079890747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:26:59,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:26:59,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:26:59,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46112829] [2024-10-24 11:26:59,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:26:59,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:26:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:26:59,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:26:59,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:26:59,335 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:00,609 INFO L93 Difference]: Finished difference Result 456 states and 642 transitions. [2024-10-24 11:27:00,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:27:00,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:27:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:00,614 INFO L225 Difference]: With dead ends: 456 [2024-10-24 11:27:00,614 INFO L226 Difference]: Without dead ends: 264 [2024-10-24 11:27:00,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:27:00,616 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 351 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:00,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 574 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:27:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-24 11:27:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 226. [2024-10-24 11:27:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.3681592039800996) internal successors, (275), 202 states have internal predecessors, (275), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 317 transitions. [2024-10-24 11:27:00,659 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 317 transitions. Word has length 129 [2024-10-24 11:27:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:00,660 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 317 transitions. [2024-10-24 11:27:00,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 317 transitions. [2024-10-24 11:27:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:27:00,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:00,662 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:00,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:27:00,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:00,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash -48214958, now seen corresponding path program 1 times [2024-10-24 11:27:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:00,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405236283] [2024-10-24 11:27:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:02,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405236283] [2024-10-24 11:27:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405236283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:02,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:02,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:27:02,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463940754] [2024-10-24 11:27:02,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:02,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:27:02,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:02,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:27:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:27:02,260 INFO L87 Difference]: Start difference. First operand 226 states and 317 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:03,419 INFO L93 Difference]: Finished difference Result 597 states and 833 transitions. [2024-10-24 11:27:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:27:03,420 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:27:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:03,422 INFO L225 Difference]: With dead ends: 597 [2024-10-24 11:27:03,423 INFO L226 Difference]: Without dead ends: 372 [2024-10-24 11:27:03,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:27:03,424 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 501 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:03,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1352 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:27:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-24 11:27:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 255. [2024-10-24 11:27:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 230 states have (on average 1.3391304347826087) internal successors, (308), 231 states have internal predecessors, (308), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 350 transitions. [2024-10-24 11:27:03,457 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 350 transitions. Word has length 129 [2024-10-24 11:27:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:03,457 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 350 transitions. [2024-10-24 11:27:03,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 350 transitions. [2024-10-24 11:27:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:27:03,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:03,459 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:03,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:27:03,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:03,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash -441241968, now seen corresponding path program 1 times [2024-10-24 11:27:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:03,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095361699] [2024-10-24 11:27:03,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:03,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:05,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095361699] [2024-10-24 11:27:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095361699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:05,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:05,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:27:05,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600624070] [2024-10-24 11:27:05,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:05,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:27:05,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:05,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:27:05,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:27:05,373 INFO L87 Difference]: Start difference. First operand 255 states and 350 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:06,258 INFO L93 Difference]: Finished difference Result 618 states and 855 transitions. [2024-10-24 11:27:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:27:06,259 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2024-10-24 11:27:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:06,262 INFO L225 Difference]: With dead ends: 618 [2024-10-24 11:27:06,262 INFO L226 Difference]: Without dead ends: 364 [2024-10-24 11:27:06,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:27:06,264 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 567 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:06,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 852 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:27:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-24 11:27:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 255. [2024-10-24 11:27:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 231 states have internal predecessors, (306), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 348 transitions. [2024-10-24 11:27:06,307 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 348 transitions. Word has length 129 [2024-10-24 11:27:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:06,308 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 348 transitions. [2024-10-24 11:27:06,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 348 transitions. [2024-10-24 11:27:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:27:06,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:06,310 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:06,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:27:06,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:06,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash -182228464, now seen corresponding path program 1 times [2024-10-24 11:27:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612020141] [2024-10-24 11:27:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:08,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:08,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:08,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612020141] [2024-10-24 11:27:08,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612020141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:08,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:08,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:27:08,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633068328] [2024-10-24 11:27:08,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:08,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:27:08,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:08,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:27:08,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:27:08,063 INFO L87 Difference]: Start difference. First operand 255 states and 348 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:08,965 INFO L93 Difference]: Finished difference Result 673 states and 929 transitions. [2024-10-24 11:27:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:27:08,966 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2024-10-24 11:27:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:08,969 INFO L225 Difference]: With dead ends: 673 [2024-10-24 11:27:08,969 INFO L226 Difference]: Without dead ends: 419 [2024-10-24 11:27:08,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:27:08,971 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 544 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:08,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 770 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:27:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-24 11:27:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 257. [2024-10-24 11:27:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 232 states have (on average 1.3275862068965518) internal successors, (308), 233 states have internal predecessors, (308), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 350 transitions. [2024-10-24 11:27:09,013 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 350 transitions. Word has length 129 [2024-10-24 11:27:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:09,014 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 350 transitions. [2024-10-24 11:27:09,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 350 transitions. [2024-10-24 11:27:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:27:09,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:09,016 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:09,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:27:09,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash -575255474, now seen corresponding path program 1 times [2024-10-24 11:27:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697819162] [2024-10-24 11:27:09,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:09,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:10,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:10,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697819162] [2024-10-24 11:27:10,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697819162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:10,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:10,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:27:10,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726240119] [2024-10-24 11:27:10,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:10,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:27:10,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:10,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:27:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:27:10,837 INFO L87 Difference]: Start difference. First operand 257 states and 350 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:11,948 INFO L93 Difference]: Finished difference Result 630 states and 865 transitions. [2024-10-24 11:27:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:27:11,948 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2024-10-24 11:27:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:11,951 INFO L225 Difference]: With dead ends: 630 [2024-10-24 11:27:11,951 INFO L226 Difference]: Without dead ends: 374 [2024-10-24 11:27:11,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:27:11,952 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 558 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:11,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1194 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:27:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-24 11:27:11,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 257. [2024-10-24 11:27:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 232 states have (on average 1.3275862068965518) internal successors, (308), 233 states have internal predecessors, (308), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 350 transitions. [2024-10-24 11:27:11,994 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 350 transitions. Word has length 129 [2024-10-24 11:27:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:11,995 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 350 transitions. [2024-10-24 11:27:11,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 350 transitions. [2024-10-24 11:27:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:27:11,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:11,997 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:11,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:27:11,997 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:11,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash -694549440, now seen corresponding path program 1 times [2024-10-24 11:27:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396696547] [2024-10-24 11:27:11,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396696547] [2024-10-24 11:27:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396696547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:13,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:13,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:27:13,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812376168] [2024-10-24 11:27:13,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:13,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:27:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:27:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:27:13,500 INFO L87 Difference]: Start difference. First operand 257 states and 350 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:14,540 INFO L93 Difference]: Finished difference Result 678 states and 931 transitions. [2024-10-24 11:27:14,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:27:14,541 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2024-10-24 11:27:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:14,543 INFO L225 Difference]: With dead ends: 678 [2024-10-24 11:27:14,543 INFO L226 Difference]: Without dead ends: 422 [2024-10-24 11:27:14,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:27:14,545 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 384 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:14,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1211 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:27:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-10-24 11:27:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 295. [2024-10-24 11:27:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 270 states have (on average 1.337037037037037) internal successors, (361), 271 states have internal predecessors, (361), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 403 transitions. [2024-10-24 11:27:14,587 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 403 transitions. Word has length 129 [2024-10-24 11:27:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:14,587 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 403 transitions. [2024-10-24 11:27:14,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 403 transitions. [2024-10-24 11:27:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:27:14,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:14,590 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:14,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:27:14,590 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:14,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1087576450, now seen corresponding path program 1 times [2024-10-24 11:27:14,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:14,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081562118] [2024-10-24 11:27:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:14,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:15,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:16,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:16,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081562118] [2024-10-24 11:27:16,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081562118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:16,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:27:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872624973] [2024-10-24 11:27:16,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:16,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:27:16,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:16,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:27:16,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:27:16,095 INFO L87 Difference]: Start difference. First operand 295 states and 403 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:16,781 INFO L93 Difference]: Finished difference Result 714 states and 980 transitions. [2024-10-24 11:27:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:27:16,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2024-10-24 11:27:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:16,785 INFO L225 Difference]: With dead ends: 714 [2024-10-24 11:27:16,785 INFO L226 Difference]: Without dead ends: 420 [2024-10-24 11:27:16,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:27:16,787 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 604 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:16,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 727 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:27:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-24 11:27:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 295. [2024-10-24 11:27:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 271 states have internal predecessors, (359), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 401 transitions. [2024-10-24 11:27:16,828 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 401 transitions. Word has length 129 [2024-10-24 11:27:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:16,828 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 401 transitions. [2024-10-24 11:27:16,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 401 transitions. [2024-10-24 11:27:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:27:16,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:16,831 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:16,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:27:16,832 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:16,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash -543085015, now seen corresponding path program 1 times [2024-10-24 11:27:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716886761] [2024-10-24 11:27:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:18,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:18,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716886761] [2024-10-24 11:27:18,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716886761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:18,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:18,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:27:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20675926] [2024-10-24 11:27:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:18,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:27:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:18,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:27:18,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:27:18,049 INFO L87 Difference]: Start difference. First operand 295 states and 401 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:19,100 INFO L93 Difference]: Finished difference Result 619 states and 839 transitions. [2024-10-24 11:27:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:27:19,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:27:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:19,103 INFO L225 Difference]: With dead ends: 619 [2024-10-24 11:27:19,103 INFO L226 Difference]: Without dead ends: 325 [2024-10-24 11:27:19,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:27:19,105 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 268 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:19,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 726 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:27:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-24 11:27:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 291. [2024-10-24 11:27:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 266 states have (on average 1.3120300751879699) internal successors, (349), 267 states have internal predecessors, (349), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 391 transitions. [2024-10-24 11:27:19,152 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 391 transitions. Word has length 129 [2024-10-24 11:27:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:19,152 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 391 transitions. [2024-10-24 11:27:19,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 391 transitions. [2024-10-24 11:27:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:27:19,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:19,154 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:19,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:27:19,154 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:19,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:19,154 INFO L85 PathProgramCache]: Analyzing trace with hash -828562946, now seen corresponding path program 1 times [2024-10-24 11:27:19,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:19,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497153819] [2024-10-24 11:27:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:19,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:20,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497153819] [2024-10-24 11:27:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497153819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:20,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:27:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130798871] [2024-10-24 11:27:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:20,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:27:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:20,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:27:20,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:27:20,497 INFO L87 Difference]: Start difference. First operand 291 states and 391 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:21,254 INFO L93 Difference]: Finished difference Result 735 states and 1002 transitions. [2024-10-24 11:27:21,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:27:21,254 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2024-10-24 11:27:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:21,257 INFO L225 Difference]: With dead ends: 735 [2024-10-24 11:27:21,257 INFO L226 Difference]: Without dead ends: 445 [2024-10-24 11:27:21,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:27:21,259 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 326 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:21,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 934 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:27:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-24 11:27:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 291. [2024-10-24 11:27:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 266 states have (on average 1.3045112781954886) internal successors, (347), 267 states have internal predecessors, (347), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 389 transitions. [2024-10-24 11:27:21,302 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 389 transitions. Word has length 129 [2024-10-24 11:27:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:21,303 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 389 transitions. [2024-10-24 11:27:21,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 389 transitions. [2024-10-24 11:27:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:27:21,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:21,305 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:21,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:27:21,306 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:21,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:21,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1221589956, now seen corresponding path program 1 times [2024-10-24 11:27:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:21,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400958905] [2024-10-24 11:27:21,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:21,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:22,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400958905] [2024-10-24 11:27:22,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400958905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:22,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:22,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:27:22,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42447930] [2024-10-24 11:27:22,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:22,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:27:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:22,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:27:22,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:27:22,233 INFO L87 Difference]: Start difference. First operand 291 states and 389 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:23,048 INFO L93 Difference]: Finished difference Result 690 states and 934 transitions. [2024-10-24 11:27:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:27:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:27:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:23,050 INFO L225 Difference]: With dead ends: 690 [2024-10-24 11:27:23,050 INFO L226 Difference]: Without dead ends: 400 [2024-10-24 11:27:23,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:27:23,052 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 295 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:23,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1707 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:27:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-24 11:27:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 283. [2024-10-24 11:27:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 258 states have (on average 1.310077519379845) internal successors, (338), 259 states have internal predecessors, (338), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 380 transitions. [2024-10-24 11:27:23,096 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 380 transitions. Word has length 129 [2024-10-24 11:27:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:23,097 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 380 transitions. [2024-10-24 11:27:23,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 380 transitions. [2024-10-24 11:27:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:27:23,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:23,099 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:23,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:27:23,099 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1239069693, now seen corresponding path program 1 times [2024-10-24 11:27:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:23,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370029496] [2024-10-24 11:27:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:23,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:23,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370029496] [2024-10-24 11:27:23,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370029496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:23,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:23,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:27:23,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525984036] [2024-10-24 11:27:23,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:23,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:27:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:23,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:27:23,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:27:23,423 INFO L87 Difference]: Start difference. First operand 283 states and 380 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:23,719 INFO L93 Difference]: Finished difference Result 661 states and 884 transitions. [2024-10-24 11:27:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:27:23,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-24 11:27:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:23,722 INFO L225 Difference]: With dead ends: 661 [2024-10-24 11:27:23,722 INFO L226 Difference]: Without dead ends: 379 [2024-10-24 11:27:23,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:27:23,723 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 89 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:23,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 829 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:27:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-24 11:27:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 299. [2024-10-24 11:27:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 274 states have (on average 1.3065693430656935) internal successors, (358), 275 states have internal predecessors, (358), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 400 transitions. [2024-10-24 11:27:23,770 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 400 transitions. Word has length 130 [2024-10-24 11:27:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:23,770 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 400 transitions. [2024-10-24 11:27:23,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 400 transitions. [2024-10-24 11:27:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:27:23,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:23,772 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:23,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:27:23,772 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:23,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1675073996, now seen corresponding path program 1 times [2024-10-24 11:27:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006606601] [2024-10-24 11:27:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:24,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:24,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006606601] [2024-10-24 11:27:24,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006606601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:24,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:27:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441387092] [2024-10-24 11:27:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:24,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:27:24,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:27:24,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:27:24,283 INFO L87 Difference]: Start difference. First operand 299 states and 400 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:24,566 INFO L93 Difference]: Finished difference Result 350 states and 472 transitions. [2024-10-24 11:27:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:27:24,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-10-24 11:27:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:24,569 INFO L225 Difference]: With dead ends: 350 [2024-10-24 11:27:24,569 INFO L226 Difference]: Without dead ends: 348 [2024-10-24 11:27:24,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:27:24,570 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 193 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:24,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 650 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:27:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-24 11:27:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 303. [2024-10-24 11:27:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 278 states have (on average 1.3021582733812949) internal successors, (362), 279 states have internal predecessors, (362), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 404 transitions. [2024-10-24 11:27:24,619 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 404 transitions. Word has length 132 [2024-10-24 11:27:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:24,619 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 404 transitions. [2024-10-24 11:27:24,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 404 transitions. [2024-10-24 11:27:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:27:24,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:24,621 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:24,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:27:24,621 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:24,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1675014414, now seen corresponding path program 1 times [2024-10-24 11:27:24,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:24,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796780603] [2024-10-24 11:27:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796780603] [2024-10-24 11:27:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796780603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:25,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:25,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:27:25,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37009504] [2024-10-24 11:27:25,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:25,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:27:25,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:25,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:27:25,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:27:25,642 INFO L87 Difference]: Start difference. First operand 303 states and 404 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:27:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:26,442 INFO L93 Difference]: Finished difference Result 870 states and 1155 transitions. [2024-10-24 11:27:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:27:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-10-24 11:27:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:26,445 INFO L225 Difference]: With dead ends: 870 [2024-10-24 11:27:26,445 INFO L226 Difference]: Without dead ends: 568 [2024-10-24 11:27:26,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:27:26,447 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 258 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:26,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1117 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:27:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-24 11:27:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 461. [2024-10-24 11:27:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 436 states have (on average 1.2821100917431192) internal successors, (559), 437 states have internal predecessors, (559), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 601 transitions. [2024-10-24 11:27:26,504 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 601 transitions. Word has length 132 [2024-10-24 11:27:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:26,504 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 601 transitions. [2024-10-24 11:27:26,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:27:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 601 transitions. [2024-10-24 11:27:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:27:26,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:26,506 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:26,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 11:27:26,506 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:26,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:26,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1332959862, now seen corresponding path program 1 times [2024-10-24 11:27:26,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431466346] [2024-10-24 11:27:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:27,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431466346] [2024-10-24 11:27:27,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431466346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:27,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:27,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:27:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404553628] [2024-10-24 11:27:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:27,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:27:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:27,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:27:27,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:27:27,097 INFO L87 Difference]: Start difference. First operand 461 states and 601 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:27,609 INFO L93 Difference]: Finished difference Result 1129 states and 1471 transitions. [2024-10-24 11:27:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:27:27,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-10-24 11:27:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:27,613 INFO L225 Difference]: With dead ends: 1129 [2024-10-24 11:27:27,613 INFO L226 Difference]: Without dead ends: 669 [2024-10-24 11:27:27,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:27:27,615 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 109 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:27,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1536 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:27:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-10-24 11:27:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 487. [2024-10-24 11:27:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 462 states have (on average 1.2965367965367964) internal successors, (599), 463 states have internal predecessors, (599), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 641 transitions. [2024-10-24 11:27:27,674 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 641 transitions. Word has length 132 [2024-10-24 11:27:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:27,675 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 641 transitions. [2024-10-24 11:27:27,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 641 transitions. [2024-10-24 11:27:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:27:27,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:27,676 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:27,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 11:27:27,677 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:27,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:27,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1004638132, now seen corresponding path program 1 times [2024-10-24 11:27:27,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:27,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545116870] [2024-10-24 11:27:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545116870] [2024-10-24 11:27:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545116870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:28,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:28,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:27:28,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883494036] [2024-10-24 11:27:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:28,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:27:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:27:28,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:27:28,190 INFO L87 Difference]: Start difference. First operand 487 states and 641 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:28,661 INFO L93 Difference]: Finished difference Result 1179 states and 1533 transitions. [2024-10-24 11:27:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:27:28,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-10-24 11:27:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:28,665 INFO L225 Difference]: With dead ends: 1179 [2024-10-24 11:27:28,665 INFO L226 Difference]: Without dead ends: 693 [2024-10-24 11:27:28,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:27:28,666 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 108 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:28,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1664 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:27:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-24 11:27:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 487. [2024-10-24 11:27:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 462 states have (on average 1.2965367965367964) internal successors, (599), 463 states have internal predecessors, (599), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 641 transitions. [2024-10-24 11:27:28,736 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 641 transitions. Word has length 132 [2024-10-24 11:27:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:28,736 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 641 transitions. [2024-10-24 11:27:28,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 641 transitions. [2024-10-24 11:27:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:27:28,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:28,738 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 11:27:28,738 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:28,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2015755382, now seen corresponding path program 1 times [2024-10-24 11:27:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313740460] [2024-10-24 11:27:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:29,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:29,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313740460] [2024-10-24 11:27:29,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313740460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:29,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:29,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:27:29,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897641120] [2024-10-24 11:27:29,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:29,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:27:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:29,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:27:29,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:27:29,453 INFO L87 Difference]: Start difference. First operand 487 states and 641 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:27:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:30,352 INFO L93 Difference]: Finished difference Result 1198 states and 1584 transitions. [2024-10-24 11:27:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:27:30,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-10-24 11:27:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:30,356 INFO L225 Difference]: With dead ends: 1198 [2024-10-24 11:27:30,358 INFO L226 Difference]: Without dead ends: 712 [2024-10-24 11:27:30,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:27:30,360 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 454 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:30,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1079 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:27:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-10-24 11:27:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 487. [2024-10-24 11:27:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 462 states have (on average 1.2922077922077921) internal successors, (597), 463 states have internal predecessors, (597), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 639 transitions. [2024-10-24 11:27:30,436 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 639 transitions. Word has length 132 [2024-10-24 11:27:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:30,436 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 639 transitions. [2024-10-24 11:27:30,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:27:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 639 transitions. [2024-10-24 11:27:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:27:30,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:30,438 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:30,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 11:27:30,438 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:30,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1601385422, now seen corresponding path program 1 times [2024-10-24 11:27:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:30,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336299329] [2024-10-24 11:27:30,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336299329] [2024-10-24 11:27:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336299329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:30,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:27:30,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798360506] [2024-10-24 11:27:30,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:27:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:30,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:27:30,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:27:30,944 INFO L87 Difference]: Start difference. First operand 487 states and 639 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:31,442 INFO L93 Difference]: Finished difference Result 1180 states and 1556 transitions. [2024-10-24 11:27:31,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:27:31,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-10-24 11:27:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:31,446 INFO L225 Difference]: With dead ends: 1180 [2024-10-24 11:27:31,446 INFO L226 Difference]: Without dead ends: 694 [2024-10-24 11:27:31,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:27:31,448 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 424 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:31,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 739 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:27:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-10-24 11:27:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 475. [2024-10-24 11:27:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 450 states have (on average 1.2866666666666666) internal successors, (579), 451 states have internal predecessors, (579), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 621 transitions. [2024-10-24 11:27:31,508 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 621 transitions. Word has length 132 [2024-10-24 11:27:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:31,509 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 621 transitions. [2024-10-24 11:27:31,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:27:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 621 transitions. [2024-10-24 11:27:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:27:31,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:31,510 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:31,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 11:27:31,511 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:31,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1990124335, now seen corresponding path program 1 times [2024-10-24 11:27:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849629520] [2024-10-24 11:27:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:32,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849629520] [2024-10-24 11:27:32,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849629520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:32,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:32,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:27:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051702601] [2024-10-24 11:27:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:32,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:27:32,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:32,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:27:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:27:32,151 INFO L87 Difference]: Start difference. First operand 475 states and 621 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:32,918 INFO L93 Difference]: Finished difference Result 1125 states and 1483 transitions. [2024-10-24 11:27:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:27:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-10-24 11:27:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:32,922 INFO L225 Difference]: With dead ends: 1125 [2024-10-24 11:27:32,922 INFO L226 Difference]: Without dead ends: 651 [2024-10-24 11:27:32,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:27:32,923 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 324 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:32,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 810 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:27:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-24 11:27:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 465. [2024-10-24 11:27:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 440 states have (on average 1.275) internal successors, (561), 441 states have internal predecessors, (561), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 603 transitions. [2024-10-24 11:27:32,985 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 603 transitions. Word has length 132 [2024-10-24 11:27:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:32,985 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 603 transitions. [2024-10-24 11:27:32,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 603 transitions. [2024-10-24 11:27:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:27:32,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:32,987 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:32,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 11:27:32,987 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:32,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1627016469, now seen corresponding path program 1 times [2024-10-24 11:27:32,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:32,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383288905] [2024-10-24 11:27:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383288905] [2024-10-24 11:27:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383288905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:33,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:33,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:27:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758682000] [2024-10-24 11:27:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:33,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:27:33,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:33,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:27:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:27:33,700 INFO L87 Difference]: Start difference. First operand 465 states and 603 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:27:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:34,156 INFO L93 Difference]: Finished difference Result 1023 states and 1321 transitions. [2024-10-24 11:27:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:27:34,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-10-24 11:27:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:34,159 INFO L225 Difference]: With dead ends: 1023 [2024-10-24 11:27:34,159 INFO L226 Difference]: Without dead ends: 559 [2024-10-24 11:27:34,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:27:34,160 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 332 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:34,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 652 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:27:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-24 11:27:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 453. [2024-10-24 11:27:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 428 states have (on average 1.264018691588785) internal successors, (541), 429 states have internal predecessors, (541), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 583 transitions. [2024-10-24 11:27:34,221 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 583 transitions. Word has length 132 [2024-10-24 11:27:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:34,222 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 583 transitions. [2024-10-24 11:27:34,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:27:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 583 transitions. [2024-10-24 11:27:34,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:27:34,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:34,224 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:34,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 11:27:34,224 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:34,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash -66896301, now seen corresponding path program 1 times [2024-10-24 11:27:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146502381] [2024-10-24 11:27:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:34,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:34,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146502381] [2024-10-24 11:27:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146502381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:34,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:27:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082298812] [2024-10-24 11:27:34,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:34,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:27:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:34,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:27:34,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:27:34,722 INFO L87 Difference]: Start difference. First operand 453 states and 583 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:35,287 INFO L93 Difference]: Finished difference Result 1012 states and 1310 transitions. [2024-10-24 11:27:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:27:35,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-10-24 11:27:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:35,290 INFO L225 Difference]: With dead ends: 1012 [2024-10-24 11:27:35,291 INFO L226 Difference]: Without dead ends: 560 [2024-10-24 11:27:35,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:27:35,292 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 366 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:35,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 809 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:27:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-24 11:27:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 425. [2024-10-24 11:27:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 400 states have (on average 1.2475) internal successors, (499), 401 states have internal predecessors, (499), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 541 transitions. [2024-10-24 11:27:35,352 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 541 transitions. Word has length 132 [2024-10-24 11:27:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:35,353 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 541 transitions. [2024-10-24 11:27:35,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:27:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 541 transitions. [2024-10-24 11:27:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:27:35,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:35,354 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 11:27:35,355 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1348445933, now seen corresponding path program 1 times [2024-10-24 11:27:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557591998] [2024-10-24 11:27:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:35,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:36,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:36,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557591998] [2024-10-24 11:27:36,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557591998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:36,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:27:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925435286] [2024-10-24 11:27:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:36,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:27:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:27:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:27:36,036 INFO L87 Difference]: Start difference. First operand 425 states and 541 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:36,503 INFO L93 Difference]: Finished difference Result 849 states and 1081 transitions. [2024-10-24 11:27:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:27:36,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-10-24 11:27:36,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:36,506 INFO L225 Difference]: With dead ends: 849 [2024-10-24 11:27:36,506 INFO L226 Difference]: Without dead ends: 425 [2024-10-24 11:27:36,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:27:36,508 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 224 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:36,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 501 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:27:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-24 11:27:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-10-24 11:27:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 400 states have (on average 1.245) internal successors, (498), 401 states have internal predecessors, (498), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:27:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 540 transitions. [2024-10-24 11:27:36,555 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 540 transitions. Word has length 134 [2024-10-24 11:27:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:36,556 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 540 transitions. [2024-10-24 11:27:36,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 540 transitions. [2024-10-24 11:27:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:27:36,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:36,557 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:36,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 11:27:36,557 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:36,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1214432427, now seen corresponding path program 1 times [2024-10-24 11:27:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:36,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526229468] [2024-10-24 11:27:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:36,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:27:36,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145947444] [2024-10-24 11:27:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:36,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:27:36,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:27:36,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:27:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:37,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 11:27:37,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:27:37,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:27:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 54 proven. 242 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 11:27:38,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:27:38,927 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 58 treesize of output 54 [2024-10-24 11:27:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:39,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526229468] [2024-10-24 11:27:39,328 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:27:39,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145947444] [2024-10-24 11:27:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145947444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:27:39,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:27:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-24 11:27:39,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235762762] [2024-10-24 11:27:39,329 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 11:27:39,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:27:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:39,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:27:39,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=244, Unknown=5, NotChecked=0, Total=306 [2024-10-24 11:27:39,332 INFO L87 Difference]: Start difference. First operand 425 states and 540 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:40,158 INFO L93 Difference]: Finished difference Result 1100 states and 1395 transitions. [2024-10-24 11:27:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:27:40,158 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-10-24 11:27:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:40,161 INFO L225 Difference]: With dead ends: 1100 [2024-10-24 11:27:40,161 INFO L226 Difference]: Without dead ends: 676 [2024-10-24 11:27:40,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=587, Unknown=5, NotChecked=0, Total=812 [2024-10-24 11:27:40,163 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 420 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:40,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 807 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:27:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-24 11:27:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 491. [2024-10-24 11:27:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 448 states have (on average 1.2455357142857142) internal successors, (558), 449 states have internal predecessors, (558), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:27:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 630 transitions. [2024-10-24 11:27:40,259 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 630 transitions. Word has length 134 [2024-10-24 11:27:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:40,260 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 630 transitions. [2024-10-24 11:27:40,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 630 transitions. [2024-10-24 11:27:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:27:40,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:40,261 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:40,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:27:40,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-24 11:27:40,466 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:40,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:40,466 INFO L85 PathProgramCache]: Analyzing trace with hash -964742657, now seen corresponding path program 1 times [2024-10-24 11:27:40,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:40,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790136038] [2024-10-24 11:27:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:40,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:27:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:27:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:27:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:27:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:27:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:27:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:27:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:27:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:27:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:27:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:27:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:27:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:27:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:27:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:27:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:27:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:27:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:27:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790136038] [2024-10-24 11:27:41,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790136038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:27:41,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:27:41,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:27:41,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138260261] [2024-10-24 11:27:41,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:27:41,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:27:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:27:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:27:41,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:27:41,273 INFO L87 Difference]: Start difference. First operand 491 states and 630 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:27:41,846 INFO L93 Difference]: Finished difference Result 915 states and 1169 transitions. [2024-10-24 11:27:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:27:41,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-10-24 11:27:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:27:41,848 INFO L225 Difference]: With dead ends: 915 [2024-10-24 11:27:41,848 INFO L226 Difference]: Without dead ends: 491 [2024-10-24 11:27:41,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:27:41,850 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 314 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:27:41,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 501 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:27:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-24 11:27:41,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2024-10-24 11:27:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 448 states have (on average 1.2433035714285714) internal successors, (557), 449 states have internal predecessors, (557), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:27:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 629 transitions. [2024-10-24 11:27:41,939 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 629 transitions. Word has length 134 [2024-10-24 11:27:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:27:41,939 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 629 transitions. [2024-10-24 11:27:41,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:27:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 629 transitions. [2024-10-24 11:27:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:27:41,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:27:41,940 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:41,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 11:27:41,940 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:27:41,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:27:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1098756163, now seen corresponding path program 1 times [2024-10-24 11:27:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:27:41,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156242205] [2024-10-24 11:27:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:27:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:27:42,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712687082] [2024-10-24 11:27:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:27:42,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:27:42,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:27:42,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:27:42,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:27:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:27:42,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:27:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:27:43,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:27:43,211 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:27:43,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:27:43,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:27:43,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-24 11:27:43,419 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:27:43,601 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:27:43,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:27:43 BoogieIcfgContainer [2024-10-24 11:27:43,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:27:43,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:27:43,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:27:43,605 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:27:43,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:26:46" (3/4) ... [2024-10-24 11:27:43,607 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:27:43,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:27:43,609 INFO L158 Benchmark]: Toolchain (without parser) took 58474.19ms. Allocated memory was 169.9MB in the beginning and 1.0GB in the end (delta: 866.1MB). Free memory was 137.6MB in the beginning and 561.7MB in the end (delta: -424.1MB). Peak memory consumption was 442.8MB. Max. memory is 16.1GB. [2024-10-24 11:27:43,609 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:27:43,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.07ms. Allocated memory is still 169.9MB. Free memory was 137.0MB in the beginning and 120.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:27:43,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.65ms. Allocated memory is still 169.9MB. Free memory was 119.8MB in the beginning and 115.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:27:43,611 INFO L158 Benchmark]: Boogie Preprocessor took 96.59ms. Allocated memory is still 169.9MB. Free memory was 115.6MB in the beginning and 110.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:27:43,613 INFO L158 Benchmark]: RCFGBuilder took 860.19ms. Allocated memory is still 169.9MB. Free memory was 110.5MB in the beginning and 134.2MB in the end (delta: -23.7MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2024-10-24 11:27:43,613 INFO L158 Benchmark]: TraceAbstraction took 57054.64ms. Allocated memory was 169.9MB in the beginning and 1.0GB in the end (delta: 866.1MB). Free memory was 133.5MB in the beginning and 562.7MB in the end (delta: -429.2MB). Peak memory consumption was 436.7MB. Max. memory is 16.1GB. [2024-10-24 11:27:43,613 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 1.0GB. Free memory was 562.7MB in the beginning and 561.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:27:43,614 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.15ms. Allocated memory is still 169.9MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.07ms. Allocated memory is still 169.9MB. Free memory was 137.0MB in the beginning and 120.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.65ms. Allocated memory is still 169.9MB. Free memory was 119.8MB in the beginning and 115.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.59ms. Allocated memory is still 169.9MB. Free memory was 115.6MB in the beginning and 110.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 860.19ms. Allocated memory is still 169.9MB. Free memory was 110.5MB in the beginning and 134.2MB in the end (delta: -23.7MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * TraceAbstraction took 57054.64ms. Allocated memory was 169.9MB in the beginning and 1.0GB in the end (delta: 866.1MB). Free memory was 133.5MB in the beginning and 562.7MB in the end (delta: -429.2MB). Peak memory consumption was 436.7MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 1.0GB. Free memory was 562.7MB in the beginning and 561.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L25] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0][0]); [L26] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1][0]); [L27] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[0][1]); [L28] float* float_Array_0_arrayfloat_Array_0arrayVar3_Pointer = &(float_Array_0[1][1]); [L29-L31] signed short int signed_short_int_Array_0[1] = { -25 }; [L29-L31] signed short int signed_short_int_Array_0[1] = { -25 }; [L32] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L36] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0][0]); [L37] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1][0]); [L38] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[0][1]); [L39] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer = &(unsigned_char_Array_0[1][1]); [L40-L42] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L43] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L44] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer = &(unsigned_long_int_Array_0[1]); [L45-L47] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L45-L47] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L45-L47] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L48] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L49] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L50] unsigned char last_1_unsigned_char_Array_0_1__1_ = 0; [L51] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 10; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] EXPR unsigned_char_Array_0[1][1] [L102] last_1_unsigned_char_Array_0_1__1_ = unsigned_char_Array_0[1][1] [L103] EXPR unsigned_long_int_Array_0[0] [L103] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L77] float_Array_0[0][0] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[0][0] [L78] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F [L78] EXPR float_Array_0[0][0] [L78] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L79] float_Array_0[1][0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[1][0] [L80] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L80] EXPR float_Array_0[1][0] [L80] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L81] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L81] CALL assume_abort_if_not(float_Array_0[1][0] != 0.0F) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L81] RET assume_abort_if_not(float_Array_0[1][0] != 0.0F) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L82] float_Array_0[0][1] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[0][1] [L83] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L83] EXPR float_Array_0[0][1] [L83] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L84] float_Array_0[1][1] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[1][1] [L85] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L85] EXPR float_Array_0[1][1] [L85] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] EXPR float_Array_0[1][1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] CALL assume_abort_if_not(float_Array_0[1][1] != 0.0F) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] RET assume_abort_if_not(float_Array_0[1][1] != 0.0F) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L87] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L90] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L91] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L93] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L94] unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L96] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L97] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L98] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L98] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L98] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 2147483647) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L99] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L114] RET updateVariables() [L115] CALL step() [L55] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L55] unsigned long int stepLocal_2 = last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)); [L56] COND TRUE stepLocal_2 != (last_1_unsigned_char_Array_0_1__1_ - 64) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L57] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L57] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L61] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L61] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L61] COND TRUE (- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))))) [L62] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L62] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L62] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) [L62] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L62] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L62] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) = (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L66] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L67] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) [L68] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L68] signed long int stepLocal_1 = - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)); [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L69] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L69] signed long int stepLocal_0 = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)); [L70] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L70] COND FALSE !(stepLocal_0 >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L106] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1 [L106] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1 VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) [L106] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L106] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) [L106] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L106] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) [L106] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L106] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L106] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L106] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) [L106] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L106] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L106] EXPR ((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106-L107] return (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L19] reach_error() VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.8s, OverallIterations: 34, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9787 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9777 mSDsluCounter, 27470 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21941 mSDsCounter, 1325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12644 IncrementalHoareTripleChecker+Invalid, 13969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1325 mSolverCounterUnsat, 5529 mSDtfsCounter, 12644 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1679 GetRequests, 1281 SyntacticMatches, 3 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=32, InterpolantAutomatonStates: 272, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 3243 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 4678 NumberOfCodeBlocks, 4678 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4243 ConstructedInterpolants, 0 QuantifiedInterpolants, 36590 SizeOfPredicates, 11 NumberOfNonLiveVariables, 543 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 33 InterpolantComputations, 32 PerfectInterpolantSequences, 13618/13860 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:27:43,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...