./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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-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-wip.fs.cvc5-61a6796-m [2024-10-14 13:34:47,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:34:47,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:34:47,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:34:47,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:34:47,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:34:47,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:34:47,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:34:47,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:34:47,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:34:47,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:34:47,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:34:47,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:34:47,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:34:47,547 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:34:47,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:34:47,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:34:47,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:34:47,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:34:47,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:34:47,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:34:47,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:34:47,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:34:47,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:34:47,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:34:47,556 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:34:47,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:34:47,556 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:34:47,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:34:47,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:34:47,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:34:47,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:34:47,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:34:47,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:34:47,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:34:47,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:34:47,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:34:47,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:34:47,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:34:47,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:34:47,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:34:47,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:34:47,560 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-14 13:34:47,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:34:47,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:34:47,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:34:47,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:34:47,841 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:34:47,843 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-14 13:34:49,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:34:49,499 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:34:49,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-4.i [2024-10-14 13:34:49,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a579cc9/98fe762321ce4a68b00210d1b46d012d/FLAGbf86302c5 [2024-10-14 13:34:49,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a579cc9/98fe762321ce4a68b00210d1b46d012d [2024-10-14 13:34:49,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:34:49,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:34:49,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:34:49,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:34:49,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:34:49,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:34:49" (1/1) ... [2024-10-14 13:34:49,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77fd488d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:49, skipping insertion in model container [2024-10-14 13:34:49,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:34:49" (1/1) ... [2024-10-14 13:34:49,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:34:50,052 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-14 13:34:50,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:34:50,172 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:34:50,187 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-14 13:34:50,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:34:50,248 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:34:50,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50 WrapperNode [2024-10-14 13:34:50,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:34:50,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:34:50,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:34:50,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:34:50,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,330 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 509 [2024-10-14 13:34:50,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:34:50,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:34:50,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:34:50,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:34:50,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,393 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-14 13:34:50,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:34:50,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:34:50,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:34:50,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:34:50,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (1/1) ... [2024-10-14 13:34:50,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:34:50,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:34:50,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:34:50,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:34:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:34:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:34:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:34:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:34:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:34:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:34:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:34:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:34:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:34:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:34:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:34:50,683 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:34:50,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:34:51,219 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-10-14 13:34:51,219 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:34:51,263 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:34:51,263 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:34:51,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:34:51 BoogieIcfgContainer [2024-10-14 13:34:51,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:34:51,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:34:51,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:34:51,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:34:51,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:34:49" (1/3) ... [2024-10-14 13:34:51,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf96262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:34:51, skipping insertion in model container [2024-10-14 13:34:51,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:34:50" (2/3) ... [2024-10-14 13:34:51,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf96262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:34:51, skipping insertion in model container [2024-10-14 13:34:51,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:34:51" (3/3) ... [2024-10-14 13:34:51,275 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-4.i [2024-10-14 13:34:51,295 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:34:51,295 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:34:51,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:34:51,363 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;@4c67fd15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:34:51,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:34:51,368 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-14 13:34:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 13:34:51,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:34:51,382 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-14 13:34:51,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:34:51,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:34:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1892406710, now seen corresponding path program 1 times [2024-10-14 13:34:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:34:51,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162751147] [2024-10-14 13:34:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:34:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:34:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:34:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:34:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:34:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:34:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:34:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:34:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:34:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:34:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:34:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:34:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:34:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:34:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:34:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:34:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:34:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:51,853 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-14 13:34:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:34:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162751147] [2024-10-14 13:34:51,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162751147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:34:51,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:34:51,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:34:51,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262003672] [2024-10-14 13:34:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:34:51,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:34:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:34:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:34:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:34:51,892 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-14 13:34:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:34:51,966 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2024-10-14 13:34:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:34:51,968 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-14 13:34:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:34:51,975 INFO L225 Difference]: With dead ends: 203 [2024-10-14 13:34:51,976 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 13:34:51,980 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-14 13:34:51,985 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-14 13:34:51,986 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-14 13:34:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 13:34:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-14 13:34:52,031 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-14 13:34:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 149 transitions. [2024-10-14 13:34:52,037 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 149 transitions. Word has length 125 [2024-10-14 13:34:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:34:52,038 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 149 transitions. [2024-10-14 13:34:52,038 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-14 13:34:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 149 transitions. [2024-10-14 13:34:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 13:34:52,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:34:52,041 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-14 13:34:52,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:34:52,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:34:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:34:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1204214304, now seen corresponding path program 1 times [2024-10-14 13:34:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:34:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592019541] [2024-10-14 13:34:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:34:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:34:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:34:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:34:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:34:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:34:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:34:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:34:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:34:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:34:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:34:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:34:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:34:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:34:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:34:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:34:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:34:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,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-14 13:34:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:34:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592019541] [2024-10-14 13:34:52,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592019541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:34:52,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:34:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:34:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626629081] [2024-10-14 13:34:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:34:52,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:34:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:34:52,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:34:52,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:34:52,458 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-14 13:34:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:34:52,523 INFO L93 Difference]: Finished difference Result 203 states and 300 transitions. [2024-10-14 13:34:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:34:52,524 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-14 13:34:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:34:52,526 INFO L225 Difference]: With dead ends: 203 [2024-10-14 13:34:52,527 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 13:34:52,528 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-14 13:34:52,530 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:34:52,530 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.0s Time] [2024-10-14 13:34:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 13:34:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-14 13:34:52,546 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-14 13:34:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-10-14 13:34:52,551 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 125 [2024-10-14 13:34:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:34:52,553 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-10-14 13:34:52,553 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-14 13:34:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-10-14 13:34:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 13:34:52,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:34:52,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] [2024-10-14 13:34:52,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:34:52,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:34:52,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:34:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1213689762, now seen corresponding path program 1 times [2024-10-14 13:34:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:34:52,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703724444] [2024-10-14 13:34:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:34:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:34:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:34:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:34:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:34:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:34:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:34:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:34:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:34:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:34:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:34:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:34:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:34:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:34:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:34:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:34:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:34:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:52,846 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-14 13:34:52,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:34:52,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703724444] [2024-10-14 13:34:52,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703724444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:34:52,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:34:52,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:34:52,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569173133] [2024-10-14 13:34:52,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:34:52,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:34:52,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:34:52,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:34:52,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:34:52,849 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-14 13:34:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:34:52,902 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2024-10-14 13:34:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:34:52,902 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-14 13:34:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:34:52,904 INFO L225 Difference]: With dead ends: 208 [2024-10-14 13:34:52,904 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 13:34:52,905 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-14 13:34:52,906 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-14 13:34:52,907 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-14 13:34:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 13:34:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-14 13:34:52,914 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-14 13:34:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-10-14 13:34:52,915 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 125 [2024-10-14 13:34:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:34:52,916 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-10-14 13:34:52,916 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-14 13:34:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-10-14 13:34:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 13:34:52,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:34:52,919 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-14 13:34:52,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:34:52,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:34:52,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:34:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1213749344, now seen corresponding path program 1 times [2024-10-14 13:34:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:34:52,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827109253] [2024-10-14 13:34:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:34:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:34:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:34:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:34:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:34:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:34:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:34:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:34:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:34:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:34:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:34:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:34:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:34:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:34:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:34:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:34:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:34:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:53,855 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-14 13:34:53,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:34:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827109253] [2024-10-14 13:34:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827109253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:34:53,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:34:53,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:34:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005145633] [2024-10-14 13:34:53,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:34:53,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:34:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:34:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:34:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:34:53,859 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-14 13:34:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:34:54,157 INFO L93 Difference]: Finished difference Result 288 states and 418 transitions. [2024-10-14 13:34:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:34:54,158 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-14 13:34:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:34:54,160 INFO L225 Difference]: With dead ends: 288 [2024-10-14 13:34:54,160 INFO L226 Difference]: Without dead ends: 184 [2024-10-14 13:34:54,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:34:54,161 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:34:54,162 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.2s Time] [2024-10-14 13:34:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-14 13:34:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2024-10-14 13:34:54,184 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-14 13:34:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 263 transitions. [2024-10-14 13:34:54,186 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 263 transitions. Word has length 125 [2024-10-14 13:34:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:34:54,188 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 263 transitions. [2024-10-14 13:34:54,188 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-14 13:34:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 263 transitions. [2024-10-14 13:34:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 13:34:54,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:34:54,193 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-14 13:34:54,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:34:54,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:34:54,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:34:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 820722334, now seen corresponding path program 1 times [2024-10-14 13:34:54,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:34:54,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853759452] [2024-10-14 13:34:54,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:34:54,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:34:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:34:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:34:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:34:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:34:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:34:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:34:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:34:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:34:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:34:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:34:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:34:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:34:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:34:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:34:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:34:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,434 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-14 13:34:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:34:54,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853759452] [2024-10-14 13:34:54,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853759452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:34:54,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:34:54,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:34:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327679678] [2024-10-14 13:34:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:34:54,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:34:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:34:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:34:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:34:54,437 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-14 13:34:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:34:54,481 INFO L93 Difference]: Finished difference Result 365 states and 531 transitions. [2024-10-14 13:34:54,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:34:54,482 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-14 13:34:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:34:54,485 INFO L225 Difference]: With dead ends: 365 [2024-10-14 13:34:54,485 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 13:34:54,488 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-14 13:34:54,489 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-14 13:34:54,492 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-14 13:34:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 13:34:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-14 13:34:54,509 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-14 13:34:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 267 transitions. [2024-10-14 13:34:54,511 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 267 transitions. Word has length 125 [2024-10-14 13:34:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:34:54,512 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 267 transitions. [2024-10-14 13:34:54,512 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-14 13:34:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 267 transitions. [2024-10-14 13:34:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:34:54,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:34:54,517 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-14 13:34:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:34:54,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:34:54,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:34:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash 249061196, now seen corresponding path program 1 times [2024-10-14 13:34:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:34:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300469108] [2024-10-14 13:34:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:34:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:34:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:34:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:34:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:34:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:34:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:34:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:34:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:34:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:34:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:34:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:34:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:34:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:34:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:34:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:34:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:34:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:54,745 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-14 13:34:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:34:54,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300469108] [2024-10-14 13:34:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300469108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:34:54,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:34:54,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:34:54,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478197171] [2024-10-14 13:34:54,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:34:54,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:34:54,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:34:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:34:54,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:34:54,748 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-14 13:34:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:34:54,787 INFO L93 Difference]: Finished difference Result 375 states and 541 transitions. [2024-10-14 13:34:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:34:54,788 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-14 13:34:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:34:54,790 INFO L225 Difference]: With dead ends: 375 [2024-10-14 13:34:54,790 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 13:34:54,791 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-14 13:34:54,792 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-14 13:34:54,792 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-14 13:34:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 13:34:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2024-10-14 13:34:54,809 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-14 13:34:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 269 transitions. [2024-10-14 13:34:54,813 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 269 transitions. Word has length 127 [2024-10-14 13:34:54,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:34:54,813 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 269 transitions. [2024-10-14 13:34:54,813 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-14 13:34:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 269 transitions. [2024-10-14 13:34:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:34:54,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:34:54,815 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-14 13:34:54,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:34:54,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:34:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:34:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1131881341, now seen corresponding path program 1 times [2024-10-14 13:34:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:34:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191926204] [2024-10-14 13:34:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:34:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:34:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:34:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:34:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:34:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:34:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:34:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:34:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:34:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:34:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:34:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:34:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:34:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:34:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:34:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:34:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:34:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:56,235 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-14 13:34:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:34:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191926204] [2024-10-14 13:34:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191926204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:34:56,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:34:56,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:34:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066862011] [2024-10-14 13:34:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:34:56,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:34:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:34:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:34:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:34:56,238 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-14 13:34:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:34:57,076 INFO L93 Difference]: Finished difference Result 588 states and 845 transitions. [2024-10-14 13:34:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:34:57,077 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-14 13:34:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:34:57,079 INFO L225 Difference]: With dead ends: 588 [2024-10-14 13:34:57,079 INFO L226 Difference]: Without dead ends: 402 [2024-10-14 13:34:57,080 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-14 13:34:57,081 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-14 13:34:57,081 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-14 13:34:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-14 13:34:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 209. [2024-10-14 13:34:57,108 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-14 13:34:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 300 transitions. [2024-10-14 13:34:57,111 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 300 transitions. Word has length 128 [2024-10-14 13:34:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:34:57,111 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 300 transitions. [2024-10-14 13:34:57,112 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-14 13:34:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 300 transitions. [2024-10-14 13:34:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:34:57,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:34:57,113 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-14 13:34:57,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:34:57,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:34:57,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:34:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1883222277, now seen corresponding path program 1 times [2024-10-14 13:34:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:34:57,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35737296] [2024-10-14 13:34:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:34:57,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:34:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:34:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:57,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:34:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:57,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:34:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:57,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:34:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:57,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:34:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:34:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:34:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:34:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:34:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:34:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:34:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:34:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:34:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:34:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:34:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:58,037 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-14 13:34:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:34:58,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35737296] [2024-10-14 13:34:58,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35737296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:34:58,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:34:58,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:34:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259958717] [2024-10-14 13:34:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:34:58,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:34:58,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:34:58,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:34:58,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:34:58,040 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-14 13:34:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:34:58,460 INFO L93 Difference]: Finished difference Result 470 states and 673 transitions. [2024-10-14 13:34:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:34:58,461 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-14 13:34:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:34:58,463 INFO L225 Difference]: With dead ends: 470 [2024-10-14 13:34:58,463 INFO L226 Difference]: Without dead ends: 262 [2024-10-14 13:34:58,464 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-14 13:34:58,465 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-14 13:34:58,465 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-14 13:34:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-14 13:34:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 124. [2024-10-14 13:34:58,482 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-14 13:34:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-10-14 13:34:58,483 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 128 [2024-10-14 13:34:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:34:58,484 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-10-14 13:34:58,484 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-14 13:34:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-10-14 13:34:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:34:58,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:34:58,486 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-14 13:34:58,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:34:58,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:34:58,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:34:58,487 INFO L85 PathProgramCache]: Analyzing trace with hash 792761383, now seen corresponding path program 1 times [2024-10-14 13:34:58,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:34:58,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756069469] [2024-10-14 13:34:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:34:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:34:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:34:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:34:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:34:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:34:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:34:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:34:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:34:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:34:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:34:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:34:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:34:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:34:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:34:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:34:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:34:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:34:59,572 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-14 13:34:59,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:34:59,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756069469] [2024-10-14 13:34:59,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756069469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:34:59,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:34:59,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:34:59,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231020466] [2024-10-14 13:34:59,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:34:59,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:34:59,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:34:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:34:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:34:59,575 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-14 13:35:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:00,383 INFO L93 Difference]: Finished difference Result 375 states and 532 transitions. [2024-10-14 13:35:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:35:00,385 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-14 13:35:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:00,387 INFO L225 Difference]: With dead ends: 375 [2024-10-14 13:35:00,387 INFO L226 Difference]: Without dead ends: 252 [2024-10-14 13:35:00,387 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-14 13:35:00,388 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 548 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:00,388 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.6s Time] [2024-10-14 13:35:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-14 13:35:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 129. [2024-10-14 13:35:00,412 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-14 13:35:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2024-10-14 13:35:00,413 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 129 [2024-10-14 13:35:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:00,413 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2024-10-14 13:35:00,413 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-14 13:35:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2024-10-14 13:35:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:00,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:00,415 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-14 13:35:00,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 13:35:00,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:00,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash -218355867, now seen corresponding path program 1 times [2024-10-14 13:35:00,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:00,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880800396] [2024-10-14 13:35:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:02,121 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-14 13:35:02,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:02,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880800396] [2024-10-14 13:35:02,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880800396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:02,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:02,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:35:02,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81419313] [2024-10-14 13:35:02,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:02,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:35:02,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:02,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:35:02,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:35:02,124 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-14 13:35:02,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:02,825 INFO L93 Difference]: Finished difference Result 326 states and 461 transitions. [2024-10-14 13:35:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:02,825 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-14 13:35:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:02,827 INFO L225 Difference]: With dead ends: 326 [2024-10-14 13:35:02,827 INFO L226 Difference]: Without dead ends: 198 [2024-10-14 13:35:02,827 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-14 13:35:02,827 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-14 13:35:02,828 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-14 13:35:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-14 13:35:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 193. [2024-10-14 13:35:02,863 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-14 13:35:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2024-10-14 13:35:02,866 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 129 [2024-10-14 13:35:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:02,866 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2024-10-14 13:35:02,867 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-14 13:35:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2024-10-14 13:35:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:02,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:02,868 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-14 13:35:02,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:35:02,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:02,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash -199679383, now seen corresponding path program 1 times [2024-10-14 13:35:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120815753] [2024-10-14 13:35:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:04,718 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-14 13:35:04,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:04,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120815753] [2024-10-14 13:35:04,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120815753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:04,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:04,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:35:04,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19841085] [2024-10-14 13:35:04,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:04,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:35:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:04,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:35:04,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:35:04,722 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-14 13:35:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:05,666 INFO L93 Difference]: Finished difference Result 456 states and 642 transitions. [2024-10-14 13:35:05,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:35:05,667 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-14 13:35:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:05,671 INFO L225 Difference]: With dead ends: 456 [2024-10-14 13:35:05,671 INFO L226 Difference]: Without dead ends: 264 [2024-10-14 13:35:05,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:35:05,673 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-14 13:35:05,673 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-14 13:35:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-14 13:35:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 226. [2024-10-14 13:35:05,707 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-14 13:35:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 317 transitions. [2024-10-14 13:35:05,708 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 317 transitions. Word has length 129 [2024-10-14 13:35:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:05,709 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 317 transitions. [2024-10-14 13:35:05,709 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-14 13:35:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 317 transitions. [2024-10-14 13:35:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:05,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:05,710 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-14 13:35:05,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:35:05,711 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:05,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash -48214958, now seen corresponding path program 1 times [2024-10-14 13:35:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70196027] [2024-10-14 13:35:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:07,391 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-14 13:35:07,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:07,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70196027] [2024-10-14 13:35:07,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70196027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:07,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:07,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 13:35:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604441742] [2024-10-14 13:35:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:07,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 13:35:07,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:07,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 13:35:07,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:35:07,394 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-14 13:35:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:08,594 INFO L93 Difference]: Finished difference Result 597 states and 833 transitions. [2024-10-14 13:35:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:35:08,595 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-14 13:35:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:08,597 INFO L225 Difference]: With dead ends: 597 [2024-10-14 13:35:08,597 INFO L226 Difference]: Without dead ends: 372 [2024-10-14 13:35:08,598 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-14 13:35:08,598 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-14 13:35:08,599 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-14 13:35:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-14 13:35:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 255. [2024-10-14 13:35:08,632 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-14 13:35:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 350 transitions. [2024-10-14 13:35:08,633 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 350 transitions. Word has length 129 [2024-10-14 13:35:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:08,634 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 350 transitions. [2024-10-14 13:35:08,634 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-14 13:35:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 350 transitions. [2024-10-14 13:35:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:08,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:08,635 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-14 13:35:08,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:35:08,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:08,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash -441241968, now seen corresponding path program 1 times [2024-10-14 13:35:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340153347] [2024-10-14 13:35:08,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:10,397 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-14 13:35:10,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:10,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340153347] [2024-10-14 13:35:10,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340153347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:10,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:10,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:35:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877273963] [2024-10-14 13:35:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:10,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:35:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:35:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:35:10,400 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-14 13:35:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:11,315 INFO L93 Difference]: Finished difference Result 618 states and 855 transitions. [2024-10-14 13:35:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:11,316 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-14 13:35:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:11,320 INFO L225 Difference]: With dead ends: 618 [2024-10-14 13:35:11,321 INFO L226 Difference]: Without dead ends: 364 [2024-10-14 13:35:11,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 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-14 13:35:11,322 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-14 13:35:11,323 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-14 13:35:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-14 13:35:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 255. [2024-10-14 13:35:11,370 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-14 13:35:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 348 transitions. [2024-10-14 13:35:11,372 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 348 transitions. Word has length 129 [2024-10-14 13:35:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:11,373 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 348 transitions. [2024-10-14 13:35:11,373 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-14 13:35:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 348 transitions. [2024-10-14 13:35:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:11,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:11,376 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-14 13:35:11,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 13:35:11,376 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:11,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:11,377 INFO L85 PathProgramCache]: Analyzing trace with hash -182228464, now seen corresponding path program 1 times [2024-10-14 13:35:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:11,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68137252] [2024-10-14 13:35:11,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:11,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:12,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:12,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:12,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:12,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:13,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:13,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:13,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:13,045 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-14 13:35:13,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:13,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68137252] [2024-10-14 13:35:13,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68137252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:13,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:13,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:35:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068508815] [2024-10-14 13:35:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:13,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:35:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:13,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:35:13,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:35:13,049 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-14 13:35:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:13,970 INFO L93 Difference]: Finished difference Result 673 states and 929 transitions. [2024-10-14 13:35:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:13,970 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-14 13:35:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:13,974 INFO L225 Difference]: With dead ends: 673 [2024-10-14 13:35:13,974 INFO L226 Difference]: Without dead ends: 419 [2024-10-14 13:35:13,975 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-14 13:35:13,976 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-14 13:35:13,976 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-14 13:35:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-14 13:35:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 257. [2024-10-14 13:35:14,041 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-14 13:35:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 350 transitions. [2024-10-14 13:35:14,043 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 350 transitions. Word has length 129 [2024-10-14 13:35:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:14,044 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 350 transitions. [2024-10-14 13:35:14,044 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-14 13:35:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 350 transitions. [2024-10-14 13:35:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:14,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:14,046 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-14 13:35:14,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 13:35:14,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:14,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:14,047 INFO L85 PathProgramCache]: Analyzing trace with hash -575255474, now seen corresponding path program 1 times [2024-10-14 13:35:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:14,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927862624] [2024-10-14 13:35:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:14,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:15,875 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-14 13:35:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927862624] [2024-10-14 13:35:15,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927862624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:15,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:15,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 13:35:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651342104] [2024-10-14 13:35:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:15,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 13:35:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:15,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 13:35:15,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:35:15,878 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-14 13:35:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:17,014 INFO L93 Difference]: Finished difference Result 630 states and 865 transitions. [2024-10-14 13:35:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:35:17,015 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-14 13:35:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:17,018 INFO L225 Difference]: With dead ends: 630 [2024-10-14 13:35:17,019 INFO L226 Difference]: Without dead ends: 374 [2024-10-14 13:35:17,020 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-14 13:35:17,020 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-14 13:35:17,021 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-14 13:35:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-14 13:35:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 257. [2024-10-14 13:35:17,086 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-14 13:35:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 350 transitions. [2024-10-14 13:35:17,088 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 350 transitions. Word has length 129 [2024-10-14 13:35:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:17,089 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 350 transitions. [2024-10-14 13:35:17,089 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-14 13:35:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 350 transitions. [2024-10-14 13:35:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:17,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:17,091 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-14 13:35:17,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 13:35:17,091 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:17,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash -694549440, now seen corresponding path program 1 times [2024-10-14 13:35:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:17,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145396727] [2024-10-14 13:35:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:17,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:18,757 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-14 13:35:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:18,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145396727] [2024-10-14 13:35:18,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145396727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:18,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:18,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 13:35:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101250770] [2024-10-14 13:35:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:18,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 13:35:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 13:35:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:35:18,759 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-14 13:35:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:19,807 INFO L93 Difference]: Finished difference Result 678 states and 931 transitions. [2024-10-14 13:35:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:35:19,808 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-14 13:35:19,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:19,811 INFO L225 Difference]: With dead ends: 678 [2024-10-14 13:35:19,811 INFO L226 Difference]: Without dead ends: 422 [2024-10-14 13:35:19,812 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-14 13:35:19,812 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 384 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:19,813 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.6s Time] [2024-10-14 13:35:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-10-14 13:35:19,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 295. [2024-10-14 13:35:19,857 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-14 13:35:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 403 transitions. [2024-10-14 13:35:19,859 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 403 transitions. Word has length 129 [2024-10-14 13:35:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:19,859 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 403 transitions. [2024-10-14 13:35:19,860 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-14 13:35:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 403 transitions. [2024-10-14 13:35:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:19,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:19,861 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-14 13:35:19,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 13:35:19,862 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:19,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1087576450, now seen corresponding path program 1 times [2024-10-14 13:35:19,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:19,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316734387] [2024-10-14 13:35:19,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:19,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:21,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-14 13:35:21,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:21,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316734387] [2024-10-14 13:35:21,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316734387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:21,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:21,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:35:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773626890] [2024-10-14 13:35:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:21,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:35:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:35:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:35:21,284 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-14 13:35:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:21,934 INFO L93 Difference]: Finished difference Result 714 states and 980 transitions. [2024-10-14 13:35:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:21,935 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-14 13:35:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:21,938 INFO L225 Difference]: With dead ends: 714 [2024-10-14 13:35:21,938 INFO L226 Difference]: Without dead ends: 420 [2024-10-14 13:35:21,939 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-14 13:35:21,939 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:21,940 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.4s Time] [2024-10-14 13:35:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-14 13:35:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 295. [2024-10-14 13:35:21,989 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-14 13:35:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 401 transitions. [2024-10-14 13:35:21,990 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 401 transitions. Word has length 129 [2024-10-14 13:35:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:21,991 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 401 transitions. [2024-10-14 13:35:21,991 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-14 13:35:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 401 transitions. [2024-10-14 13:35:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:21,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:21,993 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-14 13:35:21,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 13:35:21,993 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:21,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash -543085015, now seen corresponding path program 1 times [2024-10-14 13:35:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424825837] [2024-10-14 13:35:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:21,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:23,303 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-14 13:35:23,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:23,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424825837] [2024-10-14 13:35:23,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424825837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:23,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:23,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:35:23,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33862364] [2024-10-14 13:35:23,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:23,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:35:23,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:23,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:35:23,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:35:23,307 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-14 13:35:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:24,480 INFO L93 Difference]: Finished difference Result 619 states and 839 transitions. [2024-10-14 13:35:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:35:24,481 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-14 13:35:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:24,483 INFO L225 Difference]: With dead ends: 619 [2024-10-14 13:35:24,483 INFO L226 Difference]: Without dead ends: 325 [2024-10-14 13:35:24,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:35:24,485 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-14 13:35:24,485 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-14 13:35:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-14 13:35:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 291. [2024-10-14 13:35:24,565 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-14 13:35:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 391 transitions. [2024-10-14 13:35:24,568 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 391 transitions. Word has length 129 [2024-10-14 13:35:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:24,568 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 391 transitions. [2024-10-14 13:35:24,569 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-14 13:35:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 391 transitions. [2024-10-14 13:35:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:24,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:24,570 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-14 13:35:24,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 13:35:24,571 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:24,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash -828562946, now seen corresponding path program 1 times [2024-10-14 13:35:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291389513] [2024-10-14 13:35:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:25,895 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-14 13:35:25,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:25,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291389513] [2024-10-14 13:35:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291389513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:35:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366370424] [2024-10-14 13:35:25,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:25,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:35:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:35:25,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:35:25,898 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-14 13:35:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:26,634 INFO L93 Difference]: Finished difference Result 735 states and 1002 transitions. [2024-10-14 13:35:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:26,635 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-14 13:35:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:26,638 INFO L225 Difference]: With dead ends: 735 [2024-10-14 13:35:26,638 INFO L226 Difference]: Without dead ends: 445 [2024-10-14 13:35:26,639 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-14 13:35:26,639 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-14 13:35:26,639 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-14 13:35:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-14 13:35:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 291. [2024-10-14 13:35:26,689 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-14 13:35:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 389 transitions. [2024-10-14 13:35:26,691 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 389 transitions. Word has length 129 [2024-10-14 13:35:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:26,691 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 389 transitions. [2024-10-14 13:35:26,692 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-14 13:35:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 389 transitions. [2024-10-14 13:35:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:35:26,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:26,693 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-14 13:35:26,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 13:35:26,693 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:26,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1221589956, now seen corresponding path program 1 times [2024-10-14 13:35:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048304719] [2024-10-14 13:35:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:27,614 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-14 13:35:27,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:27,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048304719] [2024-10-14 13:35:27,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048304719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:27,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:27,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 13:35:27,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314555535] [2024-10-14 13:35:27,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:27,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 13:35:27,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:27,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 13:35:27,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:35:27,617 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-14 13:35:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:28,595 INFO L93 Difference]: Finished difference Result 690 states and 934 transitions. [2024-10-14 13:35:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:35:28,596 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-14 13:35:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:28,598 INFO L225 Difference]: With dead ends: 690 [2024-10-14 13:35:28,598 INFO L226 Difference]: Without dead ends: 400 [2024-10-14 13:35:28,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-10-14 13:35:28,600 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:28,601 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.6s Time] [2024-10-14 13:35:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-14 13:35:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 283. [2024-10-14 13:35:28,654 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-14 13:35:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 380 transitions. [2024-10-14 13:35:28,656 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 380 transitions. Word has length 129 [2024-10-14 13:35:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:28,656 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 380 transitions. [2024-10-14 13:35:28,657 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-14 13:35:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 380 transitions. [2024-10-14 13:35:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:35:28,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:28,658 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-14 13:35:28,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 13:35:28,658 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:28,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1239069693, now seen corresponding path program 1 times [2024-10-14 13:35:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519111708] [2024-10-14 13:35:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:28,967 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-14 13:35:28,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:28,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519111708] [2024-10-14 13:35:28,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519111708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:28,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:35:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630784927] [2024-10-14 13:35:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:28,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:35:28,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:28,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:35:28,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:35:28,969 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-14 13:35:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:29,311 INFO L93 Difference]: Finished difference Result 661 states and 884 transitions. [2024-10-14 13:35:29,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:35:29,312 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-14 13:35:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:29,314 INFO L225 Difference]: With dead ends: 661 [2024-10-14 13:35:29,314 INFO L226 Difference]: Without dead ends: 379 [2024-10-14 13:35:29,315 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-14 13:35:29,316 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:29,316 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.3s Time] [2024-10-14 13:35:29,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-14 13:35:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 299. [2024-10-14 13:35:29,367 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-14 13:35:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 400 transitions. [2024-10-14 13:35:29,369 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 400 transitions. Word has length 130 [2024-10-14 13:35:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:29,370 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 400 transitions. [2024-10-14 13:35:29,370 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-14 13:35:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 400 transitions. [2024-10-14 13:35:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:35:29,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:29,371 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-14 13:35:29,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 13:35:29,372 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1675073996, now seen corresponding path program 1 times [2024-10-14 13:35:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046973219] [2024-10-14 13:35:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:29,886 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-14 13:35:29,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046973219] [2024-10-14 13:35:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046973219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:29,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:35:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989041925] [2024-10-14 13:35:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:29,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:35:29,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:35:29,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:35:29,888 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-14 13:35:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:30,169 INFO L93 Difference]: Finished difference Result 350 states and 472 transitions. [2024-10-14 13:35:30,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:35:30,169 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-14 13:35:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:30,171 INFO L225 Difference]: With dead ends: 350 [2024-10-14 13:35:30,172 INFO L226 Difference]: Without dead ends: 348 [2024-10-14 13:35:30,172 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-14 13:35:30,172 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 193 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 13:35:30,173 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-14 13:35:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-14 13:35:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 303. [2024-10-14 13:35:30,222 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-14 13:35:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 404 transitions. [2024-10-14 13:35:30,223 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 404 transitions. Word has length 132 [2024-10-14 13:35:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:30,224 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 404 transitions. [2024-10-14 13:35:30,224 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-14 13:35:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 404 transitions. [2024-10-14 13:35:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:35:30,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:30,225 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-14 13:35:30,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 13:35:30,226 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:30,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1675014414, now seen corresponding path program 1 times [2024-10-14 13:35:30,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:30,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538405973] [2024-10-14 13:35:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:31,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-14 13:35:31,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:31,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538405973] [2024-10-14 13:35:31,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538405973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:31,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 13:35:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851528454] [2024-10-14 13:35:31,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:31,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 13:35:31,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:31,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 13:35:31,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:35:31,236 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-14 13:35:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:31,912 INFO L93 Difference]: Finished difference Result 870 states and 1155 transitions. [2024-10-14 13:35:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:35:31,912 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-14 13:35:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:31,915 INFO L225 Difference]: With dead ends: 870 [2024-10-14 13:35:31,916 INFO L226 Difference]: Without dead ends: 568 [2024-10-14 13:35:31,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-10-14 13:35:31,918 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 258 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:31,918 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.4s Time] [2024-10-14 13:35:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-14 13:35:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 461. [2024-10-14 13:35:31,982 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-14 13:35:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 601 transitions. [2024-10-14 13:35:31,984 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 601 transitions. Word has length 132 [2024-10-14 13:35:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:31,984 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 601 transitions. [2024-10-14 13:35:31,985 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-14 13:35:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 601 transitions. [2024-10-14 13:35:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:35:31,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:31,986 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-14 13:35:31,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 13:35:31,986 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:31,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1332959862, now seen corresponding path program 1 times [2024-10-14 13:35:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970311605] [2024-10-14 13:35:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:32,517 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-14 13:35:32,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970311605] [2024-10-14 13:35:32,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970311605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:32,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:32,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:35:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491623970] [2024-10-14 13:35:32,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:32,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:35:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:35:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:35:32,523 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-14 13:35:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:33,020 INFO L93 Difference]: Finished difference Result 1129 states and 1471 transitions. [2024-10-14 13:35:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:35:33,020 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-14 13:35:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:33,023 INFO L225 Difference]: With dead ends: 1129 [2024-10-14 13:35:33,023 INFO L226 Difference]: Without dead ends: 669 [2024-10-14 13:35:33,024 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-14 13:35:33,025 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-14 13:35:33,025 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-14 13:35:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-10-14 13:35:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 487. [2024-10-14 13:35:33,080 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-14 13:35:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 641 transitions. [2024-10-14 13:35:33,082 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 641 transitions. Word has length 132 [2024-10-14 13:35:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:33,082 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 641 transitions. [2024-10-14 13:35:33,082 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-14 13:35:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 641 transitions. [2024-10-14 13:35:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:35:33,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:33,084 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-14 13:35:33,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 13:35:33,084 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:33,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1004638132, now seen corresponding path program 1 times [2024-10-14 13:35:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766401352] [2024-10-14 13:35:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:33,534 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-14 13:35:33,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:33,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766401352] [2024-10-14 13:35:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766401352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:33,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:35:33,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394510498] [2024-10-14 13:35:33,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:33,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:35:33,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:35:33,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:35:33,536 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-14 13:35:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:34,006 INFO L93 Difference]: Finished difference Result 1179 states and 1533 transitions. [2024-10-14 13:35:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:35:34,007 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-14 13:35:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:34,009 INFO L225 Difference]: With dead ends: 1179 [2024-10-14 13:35:34,010 INFO L226 Difference]: Without dead ends: 693 [2024-10-14 13:35:34,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:35:34,011 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-14 13:35:34,011 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-14 13:35:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-14 13:35:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 487. [2024-10-14 13:35:34,079 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-14 13:35:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 641 transitions. [2024-10-14 13:35:34,082 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 641 transitions. Word has length 132 [2024-10-14 13:35:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:34,082 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 641 transitions. [2024-10-14 13:35:34,082 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-14 13:35:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 641 transitions. [2024-10-14 13:35:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:35:34,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:34,086 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-14 13:35:34,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 13:35:34,086 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:34,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2015755382, now seen corresponding path program 1 times [2024-10-14 13:35:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:34,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284374413] [2024-10-14 13:35:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:34,860 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-14 13:35:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:34,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284374413] [2024-10-14 13:35:34,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284374413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:34,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:34,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:35:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560507995] [2024-10-14 13:35:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:34,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:35:34,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:35:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:35:34,864 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-14 13:35:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:35,595 INFO L93 Difference]: Finished difference Result 1198 states and 1584 transitions. [2024-10-14 13:35:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 13:35:35,596 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-14 13:35:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:35,599 INFO L225 Difference]: With dead ends: 1198 [2024-10-14 13:35:35,599 INFO L226 Difference]: Without dead ends: 712 [2024-10-14 13:35:35,600 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-14 13:35:35,601 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 454 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:35,601 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.5s Time] [2024-10-14 13:35:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-10-14 13:35:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 487. [2024-10-14 13:35:35,656 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-14 13:35:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 639 transitions. [2024-10-14 13:35:35,659 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 639 transitions. Word has length 132 [2024-10-14 13:35:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:35,659 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 639 transitions. [2024-10-14 13:35:35,659 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-14 13:35:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 639 transitions. [2024-10-14 13:35:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:35:35,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:35,661 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-14 13:35:35,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 13:35:35,661 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:35,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:35,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1601385422, now seen corresponding path program 1 times [2024-10-14 13:35:35,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:35,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147584011] [2024-10-14 13:35:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:36,186 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-14 13:35:36,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:36,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147584011] [2024-10-14 13:35:36,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147584011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:36,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:36,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:35:36,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845097555] [2024-10-14 13:35:36,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:36,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:35:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:36,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:35:36,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:35:36,189 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-14 13:35:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:36,829 INFO L93 Difference]: Finished difference Result 1180 states and 1556 transitions. [2024-10-14 13:35:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:36,830 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-14 13:35:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:36,833 INFO L225 Difference]: With dead ends: 1180 [2024-10-14 13:35:36,834 INFO L226 Difference]: Without dead ends: 694 [2024-10-14 13:35:36,835 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-14 13:35:36,836 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:36,836 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.4s Time] [2024-10-14 13:35:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-10-14 13:35:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 475. [2024-10-14 13:35:36,906 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-14 13:35:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 621 transitions. [2024-10-14 13:35:36,908 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 621 transitions. Word has length 132 [2024-10-14 13:35:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:36,909 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 621 transitions. [2024-10-14 13:35:36,909 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-14 13:35:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 621 transitions. [2024-10-14 13:35:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:35:36,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:36,910 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-14 13:35:36,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 13:35:36,911 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:36,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1990124335, now seen corresponding path program 1 times [2024-10-14 13:35:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:36,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709825946] [2024-10-14 13:35:36,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:37,585 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-14 13:35:37,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709825946] [2024-10-14 13:35:37,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709825946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:37,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:37,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:35:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750145561] [2024-10-14 13:35:37,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:37,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:35:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:37,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:35:37,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:35:37,587 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-14 13:35:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:38,303 INFO L93 Difference]: Finished difference Result 1125 states and 1483 transitions. [2024-10-14 13:35:38,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:35:38,304 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-14 13:35:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:38,306 INFO L225 Difference]: With dead ends: 1125 [2024-10-14 13:35:38,307 INFO L226 Difference]: Without dead ends: 651 [2024-10-14 13:35:38,308 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-14 13:35:38,308 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:38,308 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.4s Time] [2024-10-14 13:35:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-14 13:35:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 465. [2024-10-14 13:35:38,382 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-14 13:35:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 603 transitions. [2024-10-14 13:35:38,383 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 603 transitions. Word has length 132 [2024-10-14 13:35:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:38,384 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 603 transitions. [2024-10-14 13:35:38,384 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-14 13:35:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 603 transitions. [2024-10-14 13:35:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:35:38,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:38,385 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-14 13:35:38,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 13:35:38,386 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:38,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1627016469, now seen corresponding path program 1 times [2024-10-14 13:35:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561948233] [2024-10-14 13:35:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:39,078 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-14 13:35:39,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:39,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561948233] [2024-10-14 13:35:39,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561948233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:39,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:39,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:35:39,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852120254] [2024-10-14 13:35:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:39,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:35:39,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:39,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:35:39,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:35:39,080 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-14 13:35:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:39,554 INFO L93 Difference]: Finished difference Result 1023 states and 1321 transitions. [2024-10-14 13:35:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:39,555 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-14 13:35:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:39,557 INFO L225 Difference]: With dead ends: 1023 [2024-10-14 13:35:39,557 INFO L226 Difference]: Without dead ends: 559 [2024-10-14 13:35:39,558 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-14 13:35:39,558 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-14 13:35:39,559 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-14 13:35:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-14 13:35:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 453. [2024-10-14 13:35:39,617 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-14 13:35:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 583 transitions. [2024-10-14 13:35:39,619 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 583 transitions. Word has length 132 [2024-10-14 13:35:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:39,620 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 583 transitions. [2024-10-14 13:35:39,620 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-14 13:35:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 583 transitions. [2024-10-14 13:35:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:35:39,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:39,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-14 13:35:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 13:35:39,621 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:39,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash -66896301, now seen corresponding path program 1 times [2024-10-14 13:35:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:39,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911986172] [2024-10-14 13:35:39,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:40,154 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-14 13:35:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:40,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911986172] [2024-10-14 13:35:40,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911986172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:40,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:40,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:35:40,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217422680] [2024-10-14 13:35:40,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:40,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:35:40,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:40,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:35:40,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:35:40,157 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-14 13:35:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:40,723 INFO L93 Difference]: Finished difference Result 1012 states and 1310 transitions. [2024-10-14 13:35:40,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:40,723 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-14 13:35:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:40,726 INFO L225 Difference]: With dead ends: 1012 [2024-10-14 13:35:40,726 INFO L226 Difference]: Without dead ends: 560 [2024-10-14 13:35:40,727 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-14 13:35:40,727 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-14 13:35:40,728 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-14 13:35:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-14 13:35:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 425. [2024-10-14 13:35:40,805 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-14 13:35:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 541 transitions. [2024-10-14 13:35:40,806 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 541 transitions. Word has length 132 [2024-10-14 13:35:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:40,807 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 541 transitions. [2024-10-14 13:35:40,807 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-14 13:35:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 541 transitions. [2024-10-14 13:35:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:35:40,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:40,808 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-14 13:35:40,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 13:35:40,809 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:40,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1348445933, now seen corresponding path program 1 times [2024-10-14 13:35:40,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:40,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795570332] [2024-10-14 13:35:40,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:41,468 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-14 13:35:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795570332] [2024-10-14 13:35:41,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795570332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:41,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:41,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:35:41,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177942942] [2024-10-14 13:35:41,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:41,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:35:41,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:41,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:35:41,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:35:41,470 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-14 13:35:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:41,843 INFO L93 Difference]: Finished difference Result 849 states and 1081 transitions. [2024-10-14 13:35:41,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:41,843 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-14 13:35:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:41,845 INFO L225 Difference]: With dead ends: 849 [2024-10-14 13:35:41,845 INFO L226 Difference]: Without dead ends: 425 [2024-10-14 13:35:41,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:35:41,846 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 224 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 13:35:41,846 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-14 13:35:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-14 13:35:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-10-14 13:35:41,916 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-14 13:35:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 540 transitions. [2024-10-14 13:35:41,918 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 540 transitions. Word has length 134 [2024-10-14 13:35:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:41,919 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 540 transitions. [2024-10-14 13:35:41,919 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-14 13:35:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 540 transitions. [2024-10-14 13:35:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:35:41,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:41,920 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-14 13:35:41,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 13:35:41,921 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:41,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1214432427, now seen corresponding path program 1 times [2024-10-14 13:35:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:41,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753395944] [2024-10-14 13:35:41,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:41,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:35:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806926921] [2024-10-14 13:35:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:42,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:35:42,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:35:42,031 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-14 13:35:42,033 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-14 13:35:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:42,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 13:35:42,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:35:43,195 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-14 13:35:43,764 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-14 13:35:43,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:35:44,202 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-14 13:35:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753395944] [2024-10-14 13:35:44,719 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:35:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806926921] [2024-10-14 13:35:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806926921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:35:44,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:35:44,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-14 13:35:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982462851] [2024-10-14 13:35:44,720 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 13:35:44,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 13:35:44,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:44,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 13:35:44,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=244, Unknown=5, NotChecked=0, Total=306 [2024-10-14 13:35:44,722 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-14 13:35:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:45,592 INFO L93 Difference]: Finished difference Result 1100 states and 1395 transitions. [2024-10-14 13:35:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:35:45,592 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-14 13:35:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:45,594 INFO L225 Difference]: With dead ends: 1100 [2024-10-14 13:35:45,594 INFO L226 Difference]: Without dead ends: 676 [2024-10-14 13:35:45,595 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-14 13:35:45,596 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-14 13:35:45,596 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-14 13:35:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-14 13:35:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 491. [2024-10-14 13:35:45,725 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-14 13:35:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 630 transitions. [2024-10-14 13:35:45,726 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 630 transitions. Word has length 134 [2024-10-14 13:35:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:45,727 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 630 transitions. [2024-10-14 13:35:45,727 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-14 13:35:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 630 transitions. [2024-10-14 13:35:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:35:45,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:45,728 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-14 13:35:45,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 13:35:45,932 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-14 13:35:45,933 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:45,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash -964742657, now seen corresponding path program 1 times [2024-10-14 13:35:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220130468] [2024-10-14 13:35:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:35:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:35:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:35:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:35:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:35:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:35:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:35:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:35:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:35:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:35:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:35:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:35:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:35:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:35:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:35:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:35:46,730 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-14 13:35:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:35:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220130468] [2024-10-14 13:35:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220130468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:35:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:35:46,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:35:46,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895815131] [2024-10-14 13:35:46,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:35:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:35:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:35:46,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:35:46,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:35:46,733 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-14 13:35:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:35:47,236 INFO L93 Difference]: Finished difference Result 915 states and 1169 transitions. [2024-10-14 13:35:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:35:47,236 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-14 13:35:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:35:47,238 INFO L225 Difference]: With dead ends: 915 [2024-10-14 13:35:47,238 INFO L226 Difference]: Without dead ends: 491 [2024-10-14 13:35:47,239 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-14 13:35:47,239 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:35:47,239 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.3s Time] [2024-10-14 13:35:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-14 13:35:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2024-10-14 13:35:47,337 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-14 13:35:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 629 transitions. [2024-10-14 13:35:47,339 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 629 transitions. Word has length 134 [2024-10-14 13:35:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:35:47,339 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 629 transitions. [2024-10-14 13:35:47,339 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-14 13:35:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 629 transitions. [2024-10-14 13:35:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:35:47,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:35:47,340 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-14 13:35:47,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 13:35:47,340 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:35:47,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:35:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1098756163, now seen corresponding path program 1 times [2024-10-14 13:35:47,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:35:47,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939286974] [2024-10-14 13:35:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:35:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:35:47,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109739319] [2024-10-14 13:35:47,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:35:47,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:35:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:35:47,419 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-14 13:35:47,421 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-14 13:35:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:35:47,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:35:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:35:48,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:35:48,375 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:35:48,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:35:48,389 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-14 13:35:48,578 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-14 13:35:48,581 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-14 13:35:48,738 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:35:48,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:35:48 BoogieIcfgContainer [2024-10-14 13:35:48,741 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:35:48,742 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:35:48,742 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:35:48,742 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:35:48,743 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:34:51" (3/4) ... [2024-10-14 13:35:48,745 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:35:48,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:35:48,747 INFO L158 Benchmark]: Toolchain (without parser) took 58875.57ms. Allocated memory was 178.3MB in the beginning and 994.1MB in the end (delta: 815.8MB). Free memory was 109.6MB in the beginning and 375.8MB in the end (delta: -266.3MB). Peak memory consumption was 551.4MB. Max. memory is 16.1GB. [2024-10-14 13:35:48,747 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:35:48,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.73ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 147.2MB in the end (delta: -37.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 13:35:48,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.96ms. Allocated memory is still 178.3MB. Free memory was 147.2MB in the beginning and 142.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 13:35:48,750 INFO L158 Benchmark]: Boogie Preprocessor took 111.80ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 137.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:35:48,752 INFO L158 Benchmark]: RCFGBuilder took 816.37ms. Allocated memory is still 178.3MB. Free memory was 137.4MB in the beginning and 92.7MB in the end (delta: 44.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-14 13:35:48,752 INFO L158 Benchmark]: TraceAbstraction took 57475.38ms. Allocated memory was 178.3MB in the beginning and 994.1MB in the end (delta: 815.8MB). Free memory was 92.0MB in the beginning and 375.8MB in the end (delta: -283.9MB). Peak memory consumption was 532.6MB. Max. memory is 16.1GB. [2024-10-14 13:35:48,752 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 994.1MB. Free memory is still 375.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:35:48,753 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.19ms. Allocated memory is still 109.1MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.73ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 147.2MB in the end (delta: -37.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.96ms. Allocated memory is still 178.3MB. Free memory was 147.2MB in the beginning and 142.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.80ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 137.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 816.37ms. Allocated memory is still 178.3MB. Free memory was 137.4MB in the beginning and 92.7MB in the end (delta: 44.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 57475.38ms. Allocated memory was 178.3MB in the beginning and 994.1MB in the end (delta: 815.8MB). Free memory was 92.0MB in the beginning and 375.8MB in the end (delta: -283.9MB). Peak memory consumption was 532.6MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 994.1MB. Free memory is still 375.8MB. 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: 57.2s, OverallIterations: 34, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9787 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9777 mSDsluCounter, 27470 SdHoareTripleChecker+Invalid, 11.2s 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, 1283 SyntacticMatches, 1 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 7.8s 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.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 3243 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 30.1s InterpolantComputationTime, 4678 NumberOfCodeBlocks, 4678 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4243 ConstructedInterpolants, 0 QuantifiedInterpolants, 40992 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-14 13:35:48,895 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebe3d6e9d03e6e5cf83180cae6564bdb73d3d5ae307bc763d1d081898bce00b0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:35:51,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:35:51,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:35:51,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:35:51,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:35:51,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:35:51,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:35:51,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:35:51,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:35:51,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:35:51,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:35:51,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:35:51,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:35:51,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:35:51,206 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:35:51,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:35:51,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:35:51,207 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:35:51,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:35:51,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:35:51,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:35:51,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:35:51,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:35:51,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:35:51,211 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:35:51,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:35:51,212 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:35:51,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:35:51,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:35:51,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:35:51,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:35:51,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:35:51,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:35:51,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:35:51,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:35:51,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:35:51,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:35:51,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:35:51,216 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:35:51,216 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:35:51,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:35:51,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:35:51,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:35:51,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:35:51,218 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:35:51,218 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-14 13:35:51,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:35:51,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:35:51,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:35:51,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:35:51,598 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:35:51,599 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