./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC --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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:06:17,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:06:17,510 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:06:17,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:06:17,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:06:17,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:06:17,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:06:17,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:06:17,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:06:17,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:06:17,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:06:17,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:06:17,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:06:17,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:06:17,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:06:17,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:06:17,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:06:17,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:06:17,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:06:17,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:06:17,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:06:17,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:06:17,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:06:17,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:06:17,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:06:17,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:06:17,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:06:17,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:06:17,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:06:17,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:06:17,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:06:17,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:06:17,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:06:17,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:06:17,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:06:17,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:06:17,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:06:17,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:06:17,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:06:17,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:06:17,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:06:17,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:06:17,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:06:17,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:06:17,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:06:17,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:06:17,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:06:17,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:06:17,569 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC 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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2024-11-24 01:06:17,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:06:17,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:06:17,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:06:17,926 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:06:17,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:06:17,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-24 01:06:21,015 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data/2db8ec7c4/e4bbaa2a0d2d4de4932c649c165feaa2/FLAGc3e1aef90 [2024-11-24 01:06:21,302 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:06:21,303 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-24 01:06:21,312 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data/2db8ec7c4/e4bbaa2a0d2d4de4932c649c165feaa2/FLAGc3e1aef90 [2024-11-24 01:06:21,328 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data/2db8ec7c4/e4bbaa2a0d2d4de4932c649c165feaa2 [2024-11-24 01:06:21,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:06:21,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:06:21,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:06:21,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:06:21,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:06:21,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751bd41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21, skipping insertion in model container [2024-11-24 01:06:21,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:06:21,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-24 01:06:21,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:06:21,642 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:06:21,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-24 01:06:21,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:06:21,734 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:06:21,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21 WrapperNode [2024-11-24 01:06:21,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:06:21,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:06:21,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:06:21,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:06:21,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,820 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 588 [2024-11-24 01:06:21,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:06:21,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:06:21,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:06:21,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:06:21,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,867 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2024-11-24 01:06:21,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:06:21,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:06:21,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:06:21,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:06:21,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (1/1) ... [2024-11-24 01:06:21,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:06:21,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:06:21,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:06:21,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:06:22,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:06:22,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-24 01:06:22,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-24 01:06:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-24 01:06:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-24 01:06:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-24 01:06:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-24 01:06:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-24 01:06:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-24 01:06:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-24 01:06:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-24 01:06:22,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-24 01:06:22,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-24 01:06:22,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-24 01:06:22,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-24 01:06:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-24 01:06:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-24 01:06:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-24 01:06:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-24 01:06:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-24 01:06:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-24 01:06:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-24 01:06:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-24 01:06:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-24 01:06:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-24 01:06:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-24 01:06:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:06:22,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:06:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:06:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 01:06:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-24 01:06:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-24 01:06:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-24 01:06:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:06:22,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:06:22,207 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:06:22,209 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:06:23,159 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-24 01:06:23,160 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:06:23,180 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:06:23,182 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:06:23,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:06:23 BoogieIcfgContainer [2024-11-24 01:06:23,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:06:23,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:06:23,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:06:23,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:06:23,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:06:21" (1/3) ... [2024-11-24 01:06:23,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da1a8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:06:23, skipping insertion in model container [2024-11-24 01:06:23,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:06:21" (2/3) ... [2024-11-24 01:06:23,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da1a8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:06:23, skipping insertion in model container [2024-11-24 01:06:23,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:06:23" (3/3) ... [2024-11-24 01:06:23,196 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-24 01:06:23,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:06:23,216 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-56.i that has 2 procedures, 126 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:06:23,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:06:23,294 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;@4d9f635c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:06:23,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:06:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-24 01:06:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-24 01:06:23,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:23,319 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:23,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:23,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash -70143542, now seen corresponding path program 1 times [2024-11-24 01:06:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455091893] [2024-11-24 01:06:23,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:23,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-24 01:06:23,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455091893] [2024-11-24 01:06:23,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455091893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:06:23,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414079473] [2024-11-24 01:06:23,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:23,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:06:23,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:06:23,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:06:23,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:06:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:24,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:06:24,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:06:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-24 01:06:24,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:06:24,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414079473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:24,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:06:24,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-24 01:06:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268473327] [2024-11-24 01:06:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:24,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:06:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:24,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:06:24,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:06:24,308 INFO L87 Difference]: Start difference. First operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:06:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:24,351 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2024-11-24 01:06:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:06:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-24 01:06:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:24,360 INFO L225 Difference]: With dead ends: 245 [2024-11-24 01:06:24,361 INFO L226 Difference]: Without dead ends: 122 [2024-11-24 01:06:24,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:06:24,367 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:24,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:06:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-24 01:06:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-24 01:06:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-24 01:06:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-24 01:06:24,421 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2024-11-24 01:06:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:24,422 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-24 01:06:24,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:06:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-24 01:06:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-24 01:06:24,427 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:24,427 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:24,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 01:06:24,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-24 01:06:24,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:24,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash 155255632, now seen corresponding path program 1 times [2024-11-24 01:06:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931106685] [2024-11-24 01:06:24,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:25,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931106685] [2024-11-24 01:06:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931106685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:25,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:25,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:06:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74169492] [2024-11-24 01:06:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:25,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:06:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:25,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:06:25,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:06:25,007 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:25,041 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2024-11-24 01:06:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:06:25,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-24 01:06:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:25,044 INFO L225 Difference]: With dead ends: 242 [2024-11-24 01:06:25,044 INFO L226 Difference]: Without dead ends: 123 [2024-11-24 01:06:25,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:06:25,046 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:25,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:06:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-24 01:06:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-24 01:06:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-24 01:06:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2024-11-24 01:06:25,076 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2024-11-24 01:06:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:25,077 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2024-11-24 01:06:25,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2024-11-24 01:06:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-24 01:06:25,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:25,084 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:25,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:06:25,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:25,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:25,085 INFO L85 PathProgramCache]: Analyzing trace with hash -662392818, now seen corresponding path program 1 times [2024-11-24 01:06:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953248319] [2024-11-24 01:06:25,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:28,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:28,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953248319] [2024-11-24 01:06:28,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953248319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:28,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:28,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-24 01:06:28,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997162914] [2024-11-24 01:06:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:28,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 01:06:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:28,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 01:06:28,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:06:28,108 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:06:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:30,909 INFO L93 Difference]: Finished difference Result 725 states and 1076 transitions. [2024-11-24 01:06:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-24 01:06:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-24 01:06:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:30,915 INFO L225 Difference]: With dead ends: 725 [2024-11-24 01:06:30,916 INFO L226 Difference]: Without dead ends: 605 [2024-11-24 01:06:30,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2024-11-24 01:06:30,919 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 890 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:30,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 2797 Invalid, 1545 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [134 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-24 01:06:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-24 01:06:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 382. [2024-11-24 01:06:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 331 states have (on average 1.4501510574018126) internal successors, (480), 332 states have internal predecessors, (480), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-24 01:06:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 574 transitions. [2024-11-24 01:06:30,996 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 574 transitions. Word has length 151 [2024-11-24 01:06:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:30,998 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 574 transitions. [2024-11-24 01:06:30,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:06:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 574 transitions. [2024-11-24 01:06:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-24 01:06:31,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:31,007 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:31,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:06:31,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:31,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash 439138535, now seen corresponding path program 1 times [2024-11-24 01:06:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:31,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049833115] [2024-11-24 01:06:31,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:31,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049833115] [2024-11-24 01:06:31,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049833115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:31,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:31,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:06:31,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915951581] [2024-11-24 01:06:31,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:31,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:06:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:31,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:06:31,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:06:31,198 INFO L87 Difference]: Start difference. First operand 382 states and 574 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:31,271 INFO L93 Difference]: Finished difference Result 758 states and 1141 transitions. [2024-11-24 01:06:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:06:31,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-24 01:06:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:31,279 INFO L225 Difference]: With dead ends: 758 [2024-11-24 01:06:31,279 INFO L226 Difference]: Without dead ends: 379 [2024-11-24 01:06:31,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:06:31,301 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:31,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:06:31,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-24 01:06:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-24 01:06:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4451219512195121) internal successors, (474), 329 states have internal predecessors, (474), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-24 01:06:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 568 transitions. [2024-11-24 01:06:31,361 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 568 transitions. Word has length 152 [2024-11-24 01:06:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:31,362 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 568 transitions. [2024-11-24 01:06:31,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:31,363 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 568 transitions. [2024-11-24 01:06:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-24 01:06:31,366 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:31,367 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:31,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:06:31,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:31,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:31,368 INFO L85 PathProgramCache]: Analyzing trace with hash -234426631, now seen corresponding path program 1 times [2024-11-24 01:06:31,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:31,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029772938] [2024-11-24 01:06:31,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029772938] [2024-11-24 01:06:31,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029772938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:31,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:31,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:06:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429747829] [2024-11-24 01:06:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:31,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:06:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:31,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:06:31,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:06:31,536 INFO L87 Difference]: Start difference. First operand 379 states and 568 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:31,618 INFO L93 Difference]: Finished difference Result 760 states and 1143 transitions. [2024-11-24 01:06:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:06:31,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-24 01:06:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:31,623 INFO L225 Difference]: With dead ends: 760 [2024-11-24 01:06:31,625 INFO L226 Difference]: Without dead ends: 384 [2024-11-24 01:06:31,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:06:31,630 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:31,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:06:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-24 01:06:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-24 01:06:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 333 states have (on average 1.4384384384384385) internal successors, (479), 334 states have internal predecessors, (479), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-24 01:06:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 573 transitions. [2024-11-24 01:06:31,681 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 573 transitions. Word has length 152 [2024-11-24 01:06:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:31,682 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 573 transitions. [2024-11-24 01:06:31,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 573 transitions. [2024-11-24 01:06:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-24 01:06:31,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:31,685 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:31,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 01:06:31,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:31,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1910188739, now seen corresponding path program 1 times [2024-11-24 01:06:31,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:31,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047182663] [2024-11-24 01:06:31,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:31,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047182663] [2024-11-24 01:06:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047182663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:31,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:31,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:06:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769745697] [2024-11-24 01:06:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:31,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:06:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:31,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:06:31,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:06:31,821 INFO L87 Difference]: Start difference. First operand 384 states and 573 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:31,889 INFO L93 Difference]: Finished difference Result 760 states and 1135 transitions. [2024-11-24 01:06:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:06:31,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-24 01:06:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:31,895 INFO L225 Difference]: With dead ends: 760 [2024-11-24 01:06:31,896 INFO L226 Difference]: Without dead ends: 379 [2024-11-24 01:06:31,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:06:31,900 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:31,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:06:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-24 01:06:31,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-24 01:06:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4298780487804879) internal successors, (469), 329 states have internal predecessors, (469), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-24 01:06:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 563 transitions. [2024-11-24 01:06:31,956 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 563 transitions. Word has length 152 [2024-11-24 01:06:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:31,957 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 563 transitions. [2024-11-24 01:06:31,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 563 transitions. [2024-11-24 01:06:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:06:31,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:31,960 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:31,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:06:31,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:31,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2133860781, now seen corresponding path program 1 times [2024-11-24 01:06:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:31,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601297014] [2024-11-24 01:06:31,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:31,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-24 01:06:32,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:32,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601297014] [2024-11-24 01:06:32,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601297014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:06:32,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642759030] [2024-11-24 01:06:32,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:32,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:06:32,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:06:32,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:06:32,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:06:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:32,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:06:32,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:06:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:32,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:06:32,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642759030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:32,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:06:32,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-24 01:06:32,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155784161] [2024-11-24 01:06:32,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:32,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:06:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:32,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:06:32,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:06:32,691 INFO L87 Difference]: Start difference. First operand 379 states and 563 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:32,768 INFO L93 Difference]: Finished difference Result 764 states and 1135 transitions. [2024-11-24 01:06:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:06:32,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:06:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:32,774 INFO L225 Difference]: With dead ends: 764 [2024-11-24 01:06:32,774 INFO L226 Difference]: Without dead ends: 388 [2024-11-24 01:06:32,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:06:32,780 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:32,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:06:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-24 01:06:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-11-24 01:06:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.4183976261127595) internal successors, (478), 338 states have internal predecessors, (478), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-24 01:06:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 572 transitions. [2024-11-24 01:06:32,834 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 572 transitions. Word has length 153 [2024-11-24 01:06:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:32,835 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 572 transitions. [2024-11-24 01:06:32,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 572 transitions. [2024-11-24 01:06:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:06:32,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:32,838 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:32,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 01:06:33,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:06:33,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:33,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:33,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1297495016, now seen corresponding path program 1 times [2024-11-24 01:06:33,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:33,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304747707] [2024-11-24 01:06:33,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:35,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304747707] [2024-11-24 01:06:35,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304747707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:35,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:35,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:06:35,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043543124] [2024-11-24 01:06:35,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:35,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:06:35,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:35,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:06:35,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:06:35,651 INFO L87 Difference]: Start difference. First operand 388 states and 572 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:36,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:36,770 INFO L93 Difference]: Finished difference Result 986 states and 1455 transitions. [2024-11-24 01:06:36,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:06:36,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:06:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:36,776 INFO L225 Difference]: With dead ends: 986 [2024-11-24 01:06:36,776 INFO L226 Difference]: Without dead ends: 601 [2024-11-24 01:06:36,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:06:36,778 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 465 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:36,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 726 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-24 01:06:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-24 01:06:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 527. [2024-11-24 01:06:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 466 states have (on average 1.4356223175965666) internal successors, (669), 468 states have internal predecessors, (669), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-24 01:06:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 781 transitions. [2024-11-24 01:06:36,886 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 781 transitions. Word has length 153 [2024-11-24 01:06:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:36,887 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 781 transitions. [2024-11-24 01:06:36,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 781 transitions. [2024-11-24 01:06:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:06:36,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:36,896 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:36,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:06:36,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:36,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash 17631338, now seen corresponding path program 1 times [2024-11-24 01:06:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:36,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396995575] [2024-11-24 01:06:36,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:38,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:38,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396995575] [2024-11-24 01:06:38,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396995575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:38,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:38,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 01:06:38,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960104655] [2024-11-24 01:06:38,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:38,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:06:38,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:38,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:06:38,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:06:38,897 INFO L87 Difference]: Start difference. First operand 527 states and 781 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:41,118 INFO L93 Difference]: Finished difference Result 1691 states and 2483 transitions. [2024-11-24 01:06:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:06:41,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:06:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:41,127 INFO L225 Difference]: With dead ends: 1691 [2024-11-24 01:06:41,127 INFO L226 Difference]: Without dead ends: 1167 [2024-11-24 01:06:41,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-11-24 01:06:41,130 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 971 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:41,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1428 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-24 01:06:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-11-24 01:06:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 778. [2024-11-24 01:06:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 669 states have (on average 1.4035874439461884) internal successors, (939), 673 states have internal predecessors, (939), 97 states have call successors, (97), 11 states have call predecessors, (97), 11 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-24 01:06:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1133 transitions. [2024-11-24 01:06:41,284 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1133 transitions. Word has length 153 [2024-11-24 01:06:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:41,285 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1133 transitions. [2024-11-24 01:06:41,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1133 transitions. [2024-11-24 01:06:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:06:41,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:41,289 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:41,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 01:06:41,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:41,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash -569174676, now seen corresponding path program 1 times [2024-11-24 01:06:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:41,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067321940] [2024-11-24 01:06:41,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:41,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:42,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067321940] [2024-11-24 01:06:42,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067321940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:42,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:42,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 01:06:42,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736829684] [2024-11-24 01:06:42,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:42,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:06:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:42,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:06:42,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:06:42,824 INFO L87 Difference]: Start difference. First operand 778 states and 1133 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:43,688 INFO L93 Difference]: Finished difference Result 1499 states and 2193 transitions. [2024-11-24 01:06:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:06:43,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:06:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:43,697 INFO L225 Difference]: With dead ends: 1499 [2024-11-24 01:06:43,697 INFO L226 Difference]: Without dead ends: 827 [2024-11-24 01:06:43,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:06:43,701 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 266 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:43,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 668 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 01:06:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-24 01:06:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 776. [2024-11-24 01:06:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 668 states have (on average 1.401197604790419) internal successors, (936), 673 states have internal predecessors, (936), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 92 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-24 01:06:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1130 transitions. [2024-11-24 01:06:43,834 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1130 transitions. Word has length 153 [2024-11-24 01:06:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:43,835 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1130 transitions. [2024-11-24 01:06:43,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1130 transitions. [2024-11-24 01:06:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:06:43,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:43,839 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:43,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:06:43,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:43,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash 561773252, now seen corresponding path program 1 times [2024-11-24 01:06:43,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:43,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067228903] [2024-11-24 01:06:43,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:44,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:44,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067228903] [2024-11-24 01:06:44,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067228903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:44,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:44,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:06:44,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929803207] [2024-11-24 01:06:44,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:44,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:06:44,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:44,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:06:44,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:06:44,046 INFO L87 Difference]: Start difference. First operand 776 states and 1130 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:44,245 INFO L93 Difference]: Finished difference Result 1518 states and 2218 transitions. [2024-11-24 01:06:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:06:44,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:06:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:44,252 INFO L225 Difference]: With dead ends: 1518 [2024-11-24 01:06:44,252 INFO L226 Difference]: Without dead ends: 801 [2024-11-24 01:06:44,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:06:44,255 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 78 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:44,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 642 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:06:44,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-24 01:06:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 761. [2024-11-24 01:06:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 653 states have (on average 1.3889739663093414) internal successors, (907), 658 states have internal predecessors, (907), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 92 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-24 01:06:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1101 transitions. [2024-11-24 01:06:44,380 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1101 transitions. Word has length 153 [2024-11-24 01:06:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:44,381 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1101 transitions. [2024-11-24 01:06:44,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1101 transitions. [2024-11-24 01:06:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:06:44,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:44,384 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:44,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 01:06:44,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:44,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1542718732, now seen corresponding path program 1 times [2024-11-24 01:06:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:44,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155074765] [2024-11-24 01:06:44,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:44,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:48,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:48,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155074765] [2024-11-24 01:06:48,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155074765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:48,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:48,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 01:06:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133657752] [2024-11-24 01:06:48,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:48,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:06:48,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:48,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:06:48,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:06:48,433 INFO L87 Difference]: Start difference. First operand 761 states and 1101 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:51,492 INFO L93 Difference]: Finished difference Result 1974 states and 2873 transitions. [2024-11-24 01:06:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:06:51,493 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:06:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:51,502 INFO L225 Difference]: With dead ends: 1974 [2024-11-24 01:06:51,502 INFO L226 Difference]: Without dead ends: 1272 [2024-11-24 01:06:51,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2024-11-24 01:06:51,505 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 342 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:51,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1655 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-24 01:06:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-11-24 01:06:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 808. [2024-11-24 01:06:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 700 states have (on average 1.3957142857142857) internal successors, (977), 704 states have internal predecessors, (977), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-24 01:06:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1171 transitions. [2024-11-24 01:06:51,632 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1171 transitions. Word has length 153 [2024-11-24 01:06:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:51,632 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1171 transitions. [2024-11-24 01:06:51,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1171 transitions. [2024-11-24 01:06:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:06:51,635 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:51,635 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:51,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 01:06:51,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:51,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash 788021926, now seen corresponding path program 1 times [2024-11-24 01:06:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:51,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642634339] [2024-11-24 01:06:51,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:53,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642634339] [2024-11-24 01:06:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642634339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:53,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:53,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 01:06:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743580884] [2024-11-24 01:06:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:06:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:53,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:06:53,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:06:53,683 INFO L87 Difference]: Start difference. First operand 808 states and 1171 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:55,288 INFO L93 Difference]: Finished difference Result 2014 states and 2928 transitions. [2024-11-24 01:06:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 01:06:55,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:06:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:55,296 INFO L225 Difference]: With dead ends: 2014 [2024-11-24 01:06:55,296 INFO L226 Difference]: Without dead ends: 1312 [2024-11-24 01:06:55,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-11-24 01:06:55,299 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 526 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:55,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1128 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-24 01:06:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-24 01:06:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 846. [2024-11-24 01:06:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 738 states have (on average 1.4024390243902438) internal successors, (1035), 742 states have internal predecessors, (1035), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-24 01:06:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1229 transitions. [2024-11-24 01:06:55,404 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1229 transitions. Word has length 153 [2024-11-24 01:06:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:55,405 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1229 transitions. [2024-11-24 01:06:55,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1229 transitions. [2024-11-24 01:06:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:06:55,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:55,408 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:55,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 01:06:55,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:55,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:55,409 INFO L85 PathProgramCache]: Analyzing trace with hash -491841752, now seen corresponding path program 1 times [2024-11-24 01:06:55,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:55,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389648029] [2024-11-24 01:06:55,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:55,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:06:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:06:56,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:06:56,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389648029] [2024-11-24 01:06:56,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389648029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:06:56,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:06:56,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 01:06:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22541188] [2024-11-24 01:06:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:06:56,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:06:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:06:56,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:06:56,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:06:56,875 INFO L87 Difference]: Start difference. First operand 846 states and 1229 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:06:58,790 INFO L93 Difference]: Finished difference Result 2084 states and 3020 transitions. [2024-11-24 01:06:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:06:58,791 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:06:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:06:58,798 INFO L225 Difference]: With dead ends: 2084 [2024-11-24 01:06:58,798 INFO L226 Difference]: Without dead ends: 1382 [2024-11-24 01:06:58,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-11-24 01:06:58,801 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 850 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:06:58,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1400 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 01:06:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-24 01:06:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 853. [2024-11-24 01:06:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 745 states have (on average 1.4013422818791947) internal successors, (1044), 749 states have internal predecessors, (1044), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-24 01:06:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1238 transitions. [2024-11-24 01:06:58,927 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1238 transitions. Word has length 153 [2024-11-24 01:06:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:06:58,928 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1238 transitions. [2024-11-24 01:06:58,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:06:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1238 transitions. [2024-11-24 01:06:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:06:58,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:06:58,931 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:06:58,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 01:06:58,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:06:58,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:06:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1078647766, now seen corresponding path program 1 times [2024-11-24 01:06:58,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:06:58,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700623569] [2024-11-24 01:06:58,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:06:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:06:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:07:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:07:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:07:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700623569] [2024-11-24 01:07:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700623569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:07:00,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:07:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:07:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815318038] [2024-11-24 01:07:00,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:07:00,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:07:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:07:00,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:07:00,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:07:00,568 INFO L87 Difference]: Start difference. First operand 853 states and 1238 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:07:01,526 INFO L93 Difference]: Finished difference Result 1826 states and 2646 transitions. [2024-11-24 01:07:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:07:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:07:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:07:01,535 INFO L225 Difference]: With dead ends: 1826 [2024-11-24 01:07:01,535 INFO L226 Difference]: Without dead ends: 1122 [2024-11-24 01:07:01,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:07:01,539 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 451 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:07:01,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 947 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 01:07:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-24 01:07:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 932. [2024-11-24 01:07:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 814 states have (on average 1.4017199017199018) internal successors, (1141), 819 states have internal predecessors, (1141), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 01:07:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1353 transitions. [2024-11-24 01:07:01,717 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1353 transitions. Word has length 153 [2024-11-24 01:07:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:07:01,718 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1353 transitions. [2024-11-24 01:07:01,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1353 transitions. [2024-11-24 01:07:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:07:01,722 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:07:01,722 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:07:01,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 01:07:01,723 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:07:01,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:07:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2052191822, now seen corresponding path program 1 times [2024-11-24 01:07:01,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:07:01,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712337143] [2024-11-24 01:07:01,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:07:01,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:07:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:07:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:07:02,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:07:02,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712337143] [2024-11-24 01:07:02,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712337143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:07:02,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:07:02,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:07:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196679814] [2024-11-24 01:07:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:07:02,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:07:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:07:02,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:07:02,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:07:02,076 INFO L87 Difference]: Start difference. First operand 932 states and 1353 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:02,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:07:02,327 INFO L93 Difference]: Finished difference Result 1720 states and 2500 transitions. [2024-11-24 01:07:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:07:02,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:07:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:07:02,332 INFO L225 Difference]: With dead ends: 1720 [2024-11-24 01:07:02,332 INFO L226 Difference]: Without dead ends: 932 [2024-11-24 01:07:02,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:07:02,335 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 4 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:07:02,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 624 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:07:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-24 01:07:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-11-24 01:07:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 814 states have (on average 1.3992628992628993) internal successors, (1139), 819 states have internal predecessors, (1139), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 01:07:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1351 transitions. [2024-11-24 01:07:02,437 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1351 transitions. Word has length 153 [2024-11-24 01:07:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:07:02,438 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1351 transitions. [2024-11-24 01:07:02,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1351 transitions. [2024-11-24 01:07:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:07:02,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:07:02,441 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:07:02,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 01:07:02,441 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:07:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:07:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1990152208, now seen corresponding path program 1 times [2024-11-24 01:07:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:07:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035667730] [2024-11-24 01:07:02,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:07:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:07:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:07:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:07:04,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:07:04,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035667730] [2024-11-24 01:07:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035667730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:07:04,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:07:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:07:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130436120] [2024-11-24 01:07:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:07:04,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:07:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:07:04,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:07:04,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:07:04,681 INFO L87 Difference]: Start difference. First operand 932 states and 1351 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:07:05,955 INFO L93 Difference]: Finished difference Result 1853 states and 2684 transitions. [2024-11-24 01:07:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:07:05,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:07:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:07:05,961 INFO L225 Difference]: With dead ends: 1853 [2024-11-24 01:07:05,961 INFO L226 Difference]: Without dead ends: 1065 [2024-11-24 01:07:05,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:07:05,964 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 338 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:07:05,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 971 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 01:07:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-24 01:07:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 936. [2024-11-24 01:07:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 818 states have (on average 1.3985330073349633) internal successors, (1144), 823 states have internal predecessors, (1144), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 01:07:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1356 transitions. [2024-11-24 01:07:06,083 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1356 transitions. Word has length 153 [2024-11-24 01:07:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:07:06,084 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1356 transitions. [2024-11-24 01:07:06,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1356 transitions. [2024-11-24 01:07:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:07:06,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:07:06,088 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:07:06,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 01:07:06,089 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:07:06,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:07:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1718009074, now seen corresponding path program 1 times [2024-11-24 01:07:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:07:06,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014916179] [2024-11-24 01:07:06,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:07:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:07:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:07:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:07:07,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:07:07,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014916179] [2024-11-24 01:07:07,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014916179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:07:07,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:07:07,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:07:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518839587] [2024-11-24 01:07:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:07:07,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:07:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:07:07,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:07:07,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:07:07,570 INFO L87 Difference]: Start difference. First operand 936 states and 1356 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:07:08,574 INFO L93 Difference]: Finished difference Result 1857 states and 2687 transitions. [2024-11-24 01:07:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:07:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:07:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:07:08,579 INFO L225 Difference]: With dead ends: 1857 [2024-11-24 01:07:08,579 INFO L226 Difference]: Without dead ends: 1065 [2024-11-24 01:07:08,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:07:08,582 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 245 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:07:08,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1184 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 01:07:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-24 01:07:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 935. [2024-11-24 01:07:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 817 states have (on average 1.397796817625459) internal successors, (1142), 822 states have internal predecessors, (1142), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 01:07:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1354 transitions. [2024-11-24 01:07:08,691 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1354 transitions. Word has length 153 [2024-11-24 01:07:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:07:08,692 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1354 transitions. [2024-11-24 01:07:08,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1354 transitions. [2024-11-24 01:07:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-24 01:07:08,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:07:08,695 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:07:08,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 01:07:08,695 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:07:08,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:07:08,696 INFO L85 PathProgramCache]: Analyzing trace with hash 412170648, now seen corresponding path program 1 times [2024-11-24 01:07:08,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:07:08,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492829981] [2024-11-24 01:07:08,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:07:08,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:07:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:07:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:07:08,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:07:08,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492829981] [2024-11-24 01:07:08,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492829981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:07:08,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:07:08,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:07:08,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524981695] [2024-11-24 01:07:08,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:07:08,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:07:08,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:07:08,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:07:08,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:07:08,844 INFO L87 Difference]: Start difference. First operand 935 states and 1354 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:07:09,040 INFO L93 Difference]: Finished difference Result 1726 states and 2501 transitions. [2024-11-24 01:07:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:07:09,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-24 01:07:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:07:09,046 INFO L225 Difference]: With dead ends: 1726 [2024-11-24 01:07:09,046 INFO L226 Difference]: Without dead ends: 935 [2024-11-24 01:07:09,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:07:09,048 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 81 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:07:09,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 786 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:07:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-24 01:07:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 933. [2024-11-24 01:07:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 815 states have (on average 1.396319018404908) internal successors, (1138), 820 states have internal predecessors, (1138), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 01:07:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1350 transitions. [2024-11-24 01:07:09,158 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1350 transitions. Word has length 153 [2024-11-24 01:07:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:07:09,158 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1350 transitions. [2024-11-24 01:07:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1350 transitions. [2024-11-24 01:07:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-24 01:07:09,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:07:09,162 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:07:09,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 01:07:09,162 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:07:09,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:07:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 254682777, now seen corresponding path program 1 times [2024-11-24 01:07:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:07:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461833434] [2024-11-24 01:07:09,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:07:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:07:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:07:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:07:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:07:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461833434] [2024-11-24 01:07:09,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461833434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:07:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:07:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:07:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100289683] [2024-11-24 01:07:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:07:09,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:07:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:07:09,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:07:09,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:07:09,241 INFO L87 Difference]: Start difference. First operand 933 states and 1350 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:07:09,368 INFO L93 Difference]: Finished difference Result 1712 states and 2478 transitions. [2024-11-24 01:07:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:07:09,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-11-24 01:07:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:07:09,375 INFO L225 Difference]: With dead ends: 1712 [2024-11-24 01:07:09,375 INFO L226 Difference]: Without dead ends: 923 [2024-11-24 01:07:09,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:07:09,379 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:07:09,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:07:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-24 01:07:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2024-11-24 01:07:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 805 states have (on average 1.391304347826087) internal successors, (1120), 810 states have internal predecessors, (1120), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 01:07:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1332 transitions. [2024-11-24 01:07:09,524 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1332 transitions. Word has length 154 [2024-11-24 01:07:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:07:09,524 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1332 transitions. [2024-11-24 01:07:09,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1332 transitions. [2024-11-24 01:07:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:07:09,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:07:09,527 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:07:09,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-24 01:07:09,528 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:07:09,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:07:09,528 INFO L85 PathProgramCache]: Analyzing trace with hash -301787730, now seen corresponding path program 1 times [2024-11-24 01:07:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:07:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451802826] [2024-11-24 01:07:09,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:07:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:07:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:07:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:07:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:07:10,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451802826] [2024-11-24 01:07:10,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451802826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:07:10,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:07:10,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 01:07:10,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884722502] [2024-11-24 01:07:10,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:07:10,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:07:10,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:07:10,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:07:10,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:07:10,269 INFO L87 Difference]: Start difference. First operand 923 states and 1332 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:07:10,816 INFO L93 Difference]: Finished difference Result 2079 states and 3002 transitions. [2024-11-24 01:07:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 01:07:10,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-24 01:07:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:07:10,824 INFO L225 Difference]: With dead ends: 2079 [2024-11-24 01:07:10,825 INFO L226 Difference]: Without dead ends: 1300 [2024-11-24 01:07:10,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:07:10,828 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 296 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:07:10,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 998 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:07:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-11-24 01:07:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1069. [2024-11-24 01:07:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 951 states have (on average 1.401682439537329) internal successors, (1333), 956 states have internal predecessors, (1333), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 01:07:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1545 transitions. [2024-11-24 01:07:11,039 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1545 transitions. Word has length 155 [2024-11-24 01:07:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:07:11,039 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1545 transitions. [2024-11-24 01:07:11,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1545 transitions. [2024-11-24 01:07:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:07:11,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:07:11,043 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:07:11,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-24 01:07:11,043 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:07:11,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:07:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash -239748116, now seen corresponding path program 1 times [2024-11-24 01:07:11,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:07:11,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932585204] [2024-11-24 01:07:11,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:07:11,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:07:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:07:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:07:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:07:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932585204] [2024-11-24 01:07:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932585204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:07:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:07:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 01:07:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400159322] [2024-11-24 01:07:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:07:12,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:07:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:07:12,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:07:12,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:07:12,409 INFO L87 Difference]: Start difference. First operand 1069 states and 1545 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:07:14,183 INFO L93 Difference]: Finished difference Result 2427 states and 3492 transitions. [2024-11-24 01:07:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:07:14,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-24 01:07:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:07:14,212 INFO L225 Difference]: With dead ends: 2427 [2024-11-24 01:07:14,213 INFO L226 Difference]: Without dead ends: 1502 [2024-11-24 01:07:14,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-11-24 01:07:14,219 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 491 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:07:14,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1804 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 01:07:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-11-24 01:07:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1106. [2024-11-24 01:07:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 988 states have (on average 1.4018218623481782) internal successors, (1385), 993 states have internal predecessors, (1385), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 01:07:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1597 transitions. [2024-11-24 01:07:14,476 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1597 transitions. Word has length 155 [2024-11-24 01:07:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:07:14,477 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1597 transitions. [2024-11-24 01:07:14,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:07:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1597 transitions. [2024-11-24 01:07:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:07:14,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:07:14,488 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:07:14,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-24 01:07:14,488 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:07:14,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:07:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1412848974, now seen corresponding path program 1 times [2024-11-24 01:07:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:07:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699099752] [2024-11-24 01:07:14,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:07:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:07:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:07:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:07:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:07:47,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699099752] [2024-11-24 01:07:47,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699099752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:07:47,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:07:47,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-24 01:07:47,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641908141] [2024-11-24 01:07:47,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:07:47,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-24 01:07:47,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:07:47,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-24 01:07:47,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-11-24 01:07:47,609 INFO L87 Difference]: Start difference. First operand 1106 states and 1597 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:08:19,728 WARN L286 SmtUtils]: Spent 23.53s on a formula simplification. DAG size of input: 147 DAG size of output: 115 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 01:08:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:26,305 INFO L93 Difference]: Finished difference Result 2400 states and 3457 transitions. [2024-11-24 01:08:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-24 01:08:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-24 01:08:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:26,312 INFO L225 Difference]: With dead ends: 2400 [2024-11-24 01:08:26,313 INFO L226 Difference]: Without dead ends: 1475 [2024-11-24 01:08:26,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=362, Invalid=1990, Unknown=0, NotChecked=0, Total=2352 [2024-11-24 01:08:26,315 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 886 mSDsluCounter, 4422 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 4734 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:26,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 4734 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-24 01:08:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2024-11-24 01:08:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1193. [2024-11-24 01:08:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1075 states have (on average 1.4083720930232557) internal successors, (1514), 1080 states have internal predecessors, (1514), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 01:08:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1726 transitions. [2024-11-24 01:08:26,456 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1726 transitions. Word has length 155 [2024-11-24 01:08:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:26,457 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1726 transitions. [2024-11-24 01:08:26,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:08:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1726 transitions. [2024-11-24 01:08:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:26,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:26,459 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:26,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-24 01:08:26,459 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:26,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:26,459 INFO L85 PathProgramCache]: Analyzing trace with hash 826042960, now seen corresponding path program 1 times [2024-11-24 01:08:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:26,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467156685] [2024-11-24 01:08:26,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467156685] [2024-11-24 01:08:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467156685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:27,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:27,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:08:27,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790438891] [2024-11-24 01:08:27,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:27,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:08:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:27,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:08:27,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:08:27,432 INFO L87 Difference]: Start difference. First operand 1193 states and 1726 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:08:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:28,658 INFO L93 Difference]: Finished difference Result 2527 states and 3628 transitions. [2024-11-24 01:08:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:08:28,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-24 01:08:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:28,664 INFO L225 Difference]: With dead ends: 2527 [2024-11-24 01:08:28,664 INFO L226 Difference]: Without dead ends: 1555 [2024-11-24 01:08:28,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:08:28,666 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 303 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:28,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 865 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-24 01:08:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-24 01:08:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1269. [2024-11-24 01:08:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1138 states have (on average 1.3963093145869947) internal successors, (1589), 1144 states have internal predecessors, (1589), 117 states have call successors, (117), 13 states have call predecessors, (117), 13 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-24 01:08:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1823 transitions. [2024-11-24 01:08:28,859 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1823 transitions. Word has length 155 [2024-11-24 01:08:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:28,860 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1823 transitions. [2024-11-24 01:08:28,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:08:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1823 transitions. [2024-11-24 01:08:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:28,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:28,862 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:28,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-24 01:08:28,865 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:28,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash 903375884, now seen corresponding path program 1 times [2024-11-24 01:08:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:28,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083088946] [2024-11-24 01:08:28,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:29,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:29,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083088946] [2024-11-24 01:08:29,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083088946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:29,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:29,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:08:29,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438968491] [2024-11-24 01:08:29,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:29,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:08:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:29,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:08:29,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:08:29,178 INFO L87 Difference]: Start difference. First operand 1269 states and 1823 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:08:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:29,514 INFO L93 Difference]: Finished difference Result 2296 states and 3297 transitions. [2024-11-24 01:08:29,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:08:29,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-24 01:08:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:29,519 INFO L225 Difference]: With dead ends: 2296 [2024-11-24 01:08:29,519 INFO L226 Difference]: Without dead ends: 1208 [2024-11-24 01:08:29,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:08:29,521 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:29,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 587 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:08:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2024-11-24 01:08:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2024-11-24 01:08:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1077 states have (on average 1.3881151346332405) internal successors, (1495), 1083 states have internal predecessors, (1495), 117 states have call successors, (117), 13 states have call predecessors, (117), 13 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-24 01:08:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1729 transitions. [2024-11-24 01:08:29,681 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1729 transitions. Word has length 155 [2024-11-24 01:08:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:29,682 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1729 transitions. [2024-11-24 01:08:29,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:08:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1729 transitions. [2024-11-24 01:08:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:29,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:29,685 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:29,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-24 01:08:29,685 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:29,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1805463764, now seen corresponding path program 1 times [2024-11-24 01:08:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:29,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999671469] [2024-11-24 01:08:29,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:29,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:31,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:31,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999671469] [2024-11-24 01:08:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999671469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:31,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-24 01:08:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111606312] [2024-11-24 01:08:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:31,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 01:08:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:31,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 01:08:31,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:08:31,162 INFO L87 Difference]: Start difference. First operand 1208 states and 1729 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:08:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:32,719 INFO L93 Difference]: Finished difference Result 2652 states and 3780 transitions. [2024-11-24 01:08:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:08:32,719 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-24 01:08:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:32,727 INFO L225 Difference]: With dead ends: 2652 [2024-11-24 01:08:32,727 INFO L226 Difference]: Without dead ends: 1625 [2024-11-24 01:08:32,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2024-11-24 01:08:32,730 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 914 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:32,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 1903 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 01:08:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-24 01:08:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1208. [2024-11-24 01:08:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1077 states have (on average 1.3881151346332405) internal successors, (1495), 1083 states have internal predecessors, (1495), 117 states have call successors, (117), 13 states have call predecessors, (117), 13 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-24 01:08:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1729 transitions. [2024-11-24 01:08:32,918 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1729 transitions. Word has length 155 [2024-11-24 01:08:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:32,919 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1729 transitions. [2024-11-24 01:08:32,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:08:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1729 transitions. [2024-11-24 01:08:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:32,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:32,923 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:32,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-24 01:08:32,925 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:32,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash 926008138, now seen corresponding path program 1 times [2024-11-24 01:08:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:32,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376773775] [2024-11-24 01:08:32,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:33,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376773775] [2024-11-24 01:08:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376773775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:33,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 01:08:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114459266] [2024-11-24 01:08:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:33,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:08:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:33,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:08:33,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:08:33,989 INFO L87 Difference]: Start difference. First operand 1208 states and 1729 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:08:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:34,620 INFO L93 Difference]: Finished difference Result 2318 states and 3305 transitions. [2024-11-24 01:08:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:08:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-24 01:08:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:34,628 INFO L225 Difference]: With dead ends: 2318 [2024-11-24 01:08:34,628 INFO L226 Difference]: Without dead ends: 1291 [2024-11-24 01:08:34,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:08:34,631 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 451 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:34,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 753 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 01:08:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-11-24 01:08:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1070. [2024-11-24 01:08:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 959 states have (on average 1.3868613138686132) internal successors, (1330), 963 states have internal predecessors, (1330), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-24 01:08:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1528 transitions. [2024-11-24 01:08:34,748 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1528 transitions. Word has length 155 [2024-11-24 01:08:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:34,748 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1528 transitions. [2024-11-24 01:08:34,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:08:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1528 transitions. [2024-11-24 01:08:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:34,750 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:34,750 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-24 01:08:34,750 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:34,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash -353855540, now seen corresponding path program 1 times [2024-11-24 01:08:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409205901] [2024-11-24 01:08:34,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:35,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:35,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409205901] [2024-11-24 01:08:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409205901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:35,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:35,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:08:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754129319] [2024-11-24 01:08:35,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:35,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:08:35,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:35,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:08:35,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:08:35,058 INFO L87 Difference]: Start difference. First operand 1070 states and 1528 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:08:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:35,419 INFO L93 Difference]: Finished difference Result 2072 states and 2951 transitions. [2024-11-24 01:08:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:08:35,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-24 01:08:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:35,425 INFO L225 Difference]: With dead ends: 2072 [2024-11-24 01:08:35,425 INFO L226 Difference]: Without dead ends: 1166 [2024-11-24 01:08:35,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:08:35,427 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 93 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:35,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 822 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:08:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2024-11-24 01:08:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1070. [2024-11-24 01:08:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 959 states have (on average 1.383733055265902) internal successors, (1327), 963 states have internal predecessors, (1327), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-24 01:08:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1525 transitions. [2024-11-24 01:08:35,549 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1525 transitions. Word has length 155 [2024-11-24 01:08:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:35,549 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1525 transitions. [2024-11-24 01:08:35,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:08:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1525 transitions. [2024-11-24 01:08:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:35,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:35,551 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:35,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-24 01:08:35,551 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:35,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash -940661554, now seen corresponding path program 1 times [2024-11-24 01:08:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753158261] [2024-11-24 01:08:35,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:41,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753158261] [2024-11-24 01:08:41,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753158261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:41,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-24 01:08:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065364043] [2024-11-24 01:08:41,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:41,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-24 01:08:41,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:41,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-24 01:08:41,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-11-24 01:08:41,675 INFO L87 Difference]: Start difference. First operand 1070 states and 1525 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:08:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:47,355 INFO L93 Difference]: Finished difference Result 2398 states and 3408 transitions. [2024-11-24 01:08:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-24 01:08:47,355 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-24 01:08:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:47,360 INFO L225 Difference]: With dead ends: 2398 [2024-11-24 01:08:47,360 INFO L226 Difference]: Without dead ends: 1492 [2024-11-24 01:08:47,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2024-11-24 01:08:47,363 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 477 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:47,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 2986 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-24 01:08:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2024-11-24 01:08:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1114. [2024-11-24 01:08:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1003 states have (on average 1.3858424725822533) internal successors, (1390), 1007 states have internal predecessors, (1390), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-24 01:08:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1588 transitions. [2024-11-24 01:08:47,476 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1588 transitions. Word has length 155 [2024-11-24 01:08:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:47,477 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1588 transitions. [2024-11-24 01:08:47,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:08:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1588 transitions. [2024-11-24 01:08:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:47,479 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:47,479 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:47,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-24 01:08:47,479 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:47,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1869854258, now seen corresponding path program 1 times [2024-11-24 01:08:47,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:47,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110133333] [2024-11-24 01:08:47,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:49,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110133333] [2024-11-24 01:08:49,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110133333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:49,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:49,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 01:08:49,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422053672] [2024-11-24 01:08:49,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:49,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 01:08:49,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:49,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 01:08:49,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-24 01:08:49,734 INFO L87 Difference]: Start difference. First operand 1114 states and 1588 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:08:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:51,929 INFO L93 Difference]: Finished difference Result 2314 states and 3299 transitions. [2024-11-24 01:08:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:08:51,930 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-24 01:08:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:51,936 INFO L225 Difference]: With dead ends: 2314 [2024-11-24 01:08:51,937 INFO L226 Difference]: Without dead ends: 1408 [2024-11-24 01:08:51,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2024-11-24 01:08:51,939 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 517 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:51,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2248 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-24 01:08:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-24 01:08:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1263. [2024-11-24 01:08:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1140 states have (on average 1.3885964912280702) internal successors, (1583), 1145 states have internal predecessors, (1583), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-24 01:08:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1803 transitions. [2024-11-24 01:08:52,083 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1803 transitions. Word has length 155 [2024-11-24 01:08:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:52,084 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1803 transitions. [2024-11-24 01:08:52,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:08:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1803 transitions. [2024-11-24 01:08:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:52,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:52,086 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:52,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-24 01:08:52,087 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:52,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1611688820, now seen corresponding path program 1 times [2024-11-24 01:08:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682209494] [2024-11-24 01:08:52,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:53,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:53,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682209494] [2024-11-24 01:08:53,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682209494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:53,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:53,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 01:08:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664987124] [2024-11-24 01:08:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:53,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 01:08:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:53,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 01:08:53,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:08:53,619 INFO L87 Difference]: Start difference. First operand 1263 states and 1803 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:08:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:54,525 INFO L93 Difference]: Finished difference Result 2606 states and 3722 transitions. [2024-11-24 01:08:54,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:08:54,526 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-24 01:08:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:54,529 INFO L225 Difference]: With dead ends: 2606 [2024-11-24 01:08:54,529 INFO L226 Difference]: Without dead ends: 1551 [2024-11-24 01:08:54,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-24 01:08:54,531 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 476 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:54,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 966 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 01:08:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-11-24 01:08:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1325. [2024-11-24 01:08:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1202 states have (on average 1.3910149750415974) internal successors, (1672), 1207 states have internal predecessors, (1672), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-24 01:08:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1892 transitions. [2024-11-24 01:08:54,648 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1892 transitions. Word has length 155 [2024-11-24 01:08:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:54,649 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1892 transitions. [2024-11-24 01:08:54,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:08:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1892 transitions. [2024-11-24 01:08:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:54,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:54,650 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:54,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-24 01:08:54,650 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:54,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1413995788, now seen corresponding path program 1 times [2024-11-24 01:08:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:54,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830071943] [2024-11-24 01:08:54,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830071943] [2024-11-24 01:08:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830071943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:55,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:08:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515675893] [2024-11-24 01:08:55,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:55,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:08:55,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:55,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:08:55,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:08:55,278 INFO L87 Difference]: Start difference. First operand 1325 states and 1892 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:08:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:56,097 INFO L93 Difference]: Finished difference Result 2778 states and 3965 transitions. [2024-11-24 01:08:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:08:56,098 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-24 01:08:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:56,102 INFO L225 Difference]: With dead ends: 2778 [2024-11-24 01:08:56,102 INFO L226 Difference]: Without dead ends: 1661 [2024-11-24 01:08:56,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:08:56,104 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 255 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:56,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 956 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 01:08:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-11-24 01:08:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1578. [2024-11-24 01:08:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1425 states have (on average 1.3852631578947368) internal successors, (1974), 1433 states have internal predecessors, (1974), 137 states have call successors, (137), 15 states have call predecessors, (137), 15 states have return successors, (137), 129 states have call predecessors, (137), 137 states have call successors, (137) [2024-11-24 01:08:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2248 transitions. [2024-11-24 01:08:56,270 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2248 transitions. Word has length 155 [2024-11-24 01:08:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:56,271 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2248 transitions. [2024-11-24 01:08:56,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:08:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2248 transitions. [2024-11-24 01:08:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:56,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:56,272 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:56,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-24 01:08:56,273 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:56,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash 53373776, now seen corresponding path program 1 times [2024-11-24 01:08:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241376356] [2024-11-24 01:08:56,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:08:57,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:08:57,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241376356] [2024-11-24 01:08:57,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241376356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:57,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:57,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:08:57,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793236193] [2024-11-24 01:08:57,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:57,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:08:57,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:08:57,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:08:57,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:08:57,823 INFO L87 Difference]: Start difference. First operand 1578 states and 2248 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-24 01:08:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:58,756 INFO L93 Difference]: Finished difference Result 3087 states and 4390 transitions. [2024-11-24 01:08:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:08:58,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-24 01:08:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:58,761 INFO L225 Difference]: With dead ends: 3087 [2024-11-24 01:08:58,762 INFO L226 Difference]: Without dead ends: 1717 [2024-11-24 01:08:58,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:08:58,764 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 255 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:58,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 869 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 01:08:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2024-11-24 01:08:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1330. [2024-11-24 01:08:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1219 states have (on average 1.3904840032813781) internal successors, (1695), 1223 states have internal predecessors, (1695), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-24 01:08:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1889 transitions. [2024-11-24 01:08:58,919 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1889 transitions. Word has length 155 [2024-11-24 01:08:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:58,919 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1889 transitions. [2024-11-24 01:08:58,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-24 01:08:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1889 transitions. [2024-11-24 01:08:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:08:58,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:58,921 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:58,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-24 01:08:58,921 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:58,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:58,922 INFO L85 PathProgramCache]: Analyzing trace with hash 311539214, now seen corresponding path program 1 times [2024-11-24 01:08:58,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:08:58,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900433835] [2024-11-24 01:08:58,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:08:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:09,367 WARN L286 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:09:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900433835] [2024-11-24 01:09:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900433835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:26,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-24 01:09:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989380354] [2024-11-24 01:09:26,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:26,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 01:09:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:26,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 01:09:26,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:09:26,991 INFO L87 Difference]: Start difference. First operand 1330 states and 1889 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:30,102 INFO L93 Difference]: Finished difference Result 2609 states and 3698 transitions. [2024-11-24 01:09:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:09:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-24 01:09:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:30,106 INFO L225 Difference]: With dead ends: 2609 [2024-11-24 01:09:30,106 INFO L226 Difference]: Without dead ends: 1487 [2024-11-24 01:09:30,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-24 01:09:30,108 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 230 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:30,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 2223 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-24 01:09:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2024-11-24 01:09:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1330. [2024-11-24 01:09:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1219 states have (on average 1.3896636587366693) internal successors, (1694), 1223 states have internal predecessors, (1694), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-24 01:09:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1888 transitions. [2024-11-24 01:09:30,265 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1888 transitions. Word has length 155 [2024-11-24 01:09:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:30,265 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1888 transitions. [2024-11-24 01:09:30,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1888 transitions. [2024-11-24 01:09:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:09:30,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:30,266 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:30,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-24 01:09:30,266 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:30,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash -483650864, now seen corresponding path program 1 times [2024-11-24 01:09:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:30,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502151374] [2024-11-24 01:09:30,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:30,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502151374] [2024-11-24 01:09:30,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502151374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:30,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:30,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:09:30,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786486884] [2024-11-24 01:09:30,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:30,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:09:30,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:30,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:09:30,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:09:30,747 INFO L87 Difference]: Start difference. First operand 1330 states and 1888 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:09:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:31,720 INFO L93 Difference]: Finished difference Result 2537 states and 3597 transitions. [2024-11-24 01:09:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:09:31,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-24 01:09:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:31,727 INFO L225 Difference]: With dead ends: 2537 [2024-11-24 01:09:31,727 INFO L226 Difference]: Without dead ends: 1415 [2024-11-24 01:09:31,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:09:31,730 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 253 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:31,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 783 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 01:09:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-24 01:09:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1201. [2024-11-24 01:09:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1112 states have (on average 1.3920863309352518) internal successors, (1548), 1114 states have internal predecessors, (1548), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-24 01:09:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1702 transitions. [2024-11-24 01:09:31,880 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1702 transitions. Word has length 155 [2024-11-24 01:09:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1702 transitions. [2024-11-24 01:09:31,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:09:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1702 transitions. [2024-11-24 01:09:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:09:31,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:31,882 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-24 01:09:31,883 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:31,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1494768114, now seen corresponding path program 1 times [2024-11-24 01:09:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134069755] [2024-11-24 01:09:31,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:33,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134069755] [2024-11-24 01:09:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134069755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-24 01:09:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946785025] [2024-11-24 01:09:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:33,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:09:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:33,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:09:33,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:09:33,697 INFO L87 Difference]: Start difference. First operand 1201 states and 1702 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:09:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:35,868 INFO L93 Difference]: Finished difference Result 2340 states and 3312 transitions. [2024-11-24 01:09:35,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:09:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-24 01:09:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:35,874 INFO L225 Difference]: With dead ends: 2340 [2024-11-24 01:09:35,874 INFO L226 Difference]: Without dead ends: 1347 [2024-11-24 01:09:35,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2024-11-24 01:09:35,877 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 446 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:35,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2468 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-24 01:09:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-11-24 01:09:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1195. [2024-11-24 01:09:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1106 states have (on average 1.3942133815551536) internal successors, (1542), 1108 states have internal predecessors, (1542), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-24 01:09:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1696 transitions. [2024-11-24 01:09:36,119 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1696 transitions. Word has length 155 [2024-11-24 01:09:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:36,119 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1696 transitions. [2024-11-24 01:09:36,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:09:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1696 transitions. [2024-11-24 01:09:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-24 01:09:36,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:36,121 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-24 01:09:36,121 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:36,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash 686625358, now seen corresponding path program 1 times [2024-11-24 01:09:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:36,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86286884] [2024-11-24 01:09:36,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:36,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:37,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:37,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86286884] [2024-11-24 01:09:37,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86286884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:37,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:37,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 01:09:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322445740] [2024-11-24 01:09:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:37,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 01:09:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:37,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 01:09:37,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-24 01:09:37,808 INFO L87 Difference]: Start difference. First operand 1195 states and 1696 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:09:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:40,194 INFO L93 Difference]: Finished difference Result 2325 states and 3297 transitions. [2024-11-24 01:09:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:09:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-24 01:09:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:40,200 INFO L225 Difference]: With dead ends: 2325 [2024-11-24 01:09:40,200 INFO L226 Difference]: Without dead ends: 1338 [2024-11-24 01:09:40,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2024-11-24 01:09:40,203 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 346 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:40,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 2245 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-24 01:09:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-11-24 01:09:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1190. [2024-11-24 01:09:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1101 states have (on average 1.3960036330608538) internal successors, (1537), 1103 states have internal predecessors, (1537), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-24 01:09:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1691 transitions. [2024-11-24 01:09:40,416 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1691 transitions. Word has length 155 [2024-11-24 01:09:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:40,417 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1691 transitions. [2024-11-24 01:09:40,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:09:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1691 transitions. [2024-11-24 01:09:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-24 01:09:40,418 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:40,419 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:40,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-24 01:09:40,419 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:40,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash -612042519, now seen corresponding path program 1 times [2024-11-24 01:09:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649781981] [2024-11-24 01:09:40,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:40,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:40,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649781981] [2024-11-24 01:09:40,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649781981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:40,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:40,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:09:40,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42779011] [2024-11-24 01:09:40,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:40,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:09:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:40,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:09:40,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:09:40,495 INFO L87 Difference]: Start difference. First operand 1190 states and 1691 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:40,729 INFO L93 Difference]: Finished difference Result 2185 states and 3110 transitions. [2024-11-24 01:09:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:09:40,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-24 01:09:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:40,734 INFO L225 Difference]: With dead ends: 2185 [2024-11-24 01:09:40,734 INFO L226 Difference]: Without dead ends: 1198 [2024-11-24 01:09:40,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:09:40,737 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:40,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:09:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-24 01:09:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2024-11-24 01:09:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1109 states have (on average 1.393146979260595) internal successors, (1545), 1111 states have internal predecessors, (1545), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-24 01:09:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1699 transitions. [2024-11-24 01:09:40,960 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1699 transitions. Word has length 156 [2024-11-24 01:09:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:40,960 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1699 transitions. [2024-11-24 01:09:40,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1699 transitions. [2024-11-24 01:09:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-24 01:09:40,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:40,962 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:40,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-24 01:09:40,963 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:40,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash -353877081, now seen corresponding path program 1 times [2024-11-24 01:09:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:40,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629400964] [2024-11-24 01:09:40,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:40,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-24 01:09:41,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:41,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629400964] [2024-11-24 01:09:41,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629400964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:09:41,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625332949] [2024-11-24 01:09:41,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:41,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:09:41,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:09:41,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:09:41,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:09:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:41,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 01:09:41,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:09:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:41,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:09:41,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625332949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:41,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:09:41,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-24 01:09:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604609665] [2024-11-24 01:09:41,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:41,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:09:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:41,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:09:41,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:09:41,644 INFO L87 Difference]: Start difference. First operand 1198 states and 1699 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:41,845 INFO L93 Difference]: Finished difference Result 2219 states and 3143 transitions. [2024-11-24 01:09:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:09:41,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-24 01:09:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:41,849 INFO L225 Difference]: With dead ends: 2219 [2024-11-24 01:09:41,849 INFO L226 Difference]: Without dead ends: 1230 [2024-11-24 01:09:41,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:09:41,851 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:41,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 859 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:09:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-24 01:09:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1206. [2024-11-24 01:09:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1117 states have (on average 1.3903312444046554) internal successors, (1553), 1119 states have internal predecessors, (1553), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-24 01:09:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1707 transitions. [2024-11-24 01:09:41,982 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1707 transitions. Word has length 156 [2024-11-24 01:09:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:41,983 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1707 transitions. [2024-11-24 01:09:41,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1707 transitions. [2024-11-24 01:09:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-24 01:09:41,983 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:41,984 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:41,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-24 01:09:42,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-24 01:09:42,184 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1927855748, now seen corresponding path program 1 times [2024-11-24 01:09:42,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:42,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797214813] [2024-11-24 01:09:42,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:42,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:42,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:42,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797214813] [2024-11-24 01:09:42,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797214813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:42,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:42,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:09:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643169701] [2024-11-24 01:09:42,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:42,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:09:42,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:42,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:09:42,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:09:42,383 INFO L87 Difference]: Start difference. First operand 1206 states and 1707 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:42,604 INFO L93 Difference]: Finished difference Result 2615 states and 3609 transitions. [2024-11-24 01:09:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:09:42,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-24 01:09:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:42,610 INFO L225 Difference]: With dead ends: 2615 [2024-11-24 01:09:42,610 INFO L226 Difference]: Without dead ends: 1611 [2024-11-24 01:09:42,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:09:42,612 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 53 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:42,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 631 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:09:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-11-24 01:09:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1471. [2024-11-24 01:09:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1382 states have (on average 1.329232995658466) internal successors, (1837), 1384 states have internal predecessors, (1837), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-24 01:09:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1991 transitions. [2024-11-24 01:09:42,826 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1991 transitions. Word has length 158 [2024-11-24 01:09:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:42,826 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 1991 transitions. [2024-11-24 01:09:42,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1991 transitions. [2024-11-24 01:09:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-24 01:09:42,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:42,828 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-24 01:09:42,829 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash -743455959, now seen corresponding path program 1 times [2024-11-24 01:09:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:42,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844892270] [2024-11-24 01:09:42,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:42,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844892270] [2024-11-24 01:09:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844892270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:09:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277543145] [2024-11-24 01:09:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:42,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:09:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:42,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:09:42,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:09:42,908 INFO L87 Difference]: Start difference. First operand 1471 states and 1991 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:43,117 INFO L93 Difference]: Finished difference Result 2698 states and 3655 transitions. [2024-11-24 01:09:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:09:43,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-24 01:09:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:43,123 INFO L225 Difference]: With dead ends: 2698 [2024-11-24 01:09:43,123 INFO L226 Difference]: Without dead ends: 1475 [2024-11-24 01:09:43,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:09:43,125 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:43,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:09:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2024-11-24 01:09:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2024-11-24 01:09:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1386 states have (on average 1.3282828282828283) internal successors, (1841), 1388 states have internal predecessors, (1841), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-24 01:09:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1995 transitions. [2024-11-24 01:09:43,352 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1995 transitions. Word has length 158 [2024-11-24 01:09:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:43,353 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1995 transitions. [2024-11-24 01:09:43,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1995 transitions. [2024-11-24 01:09:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-24 01:09:43,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:43,355 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-24 01:09:43,355 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:43,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1031551403, now seen corresponding path program 1 times [2024-11-24 01:09:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:43,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273709811] [2024-11-24 01:09:43,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:43,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:43,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273709811] [2024-11-24 01:09:43,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273709811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:43,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:43,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 01:09:43,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559656760] [2024-11-24 01:09:43,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:43,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 01:09:43,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:43,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 01:09:43,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:09:43,984 INFO L87 Difference]: Start difference. First operand 1475 states and 1995 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:44,389 INFO L93 Difference]: Finished difference Result 2374 states and 3133 transitions. [2024-11-24 01:09:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:09:44,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-24 01:09:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:44,397 INFO L225 Difference]: With dead ends: 2374 [2024-11-24 01:09:44,398 INFO L226 Difference]: Without dead ends: 2372 [2024-11-24 01:09:44,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-24 01:09:44,399 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 259 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:44,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 953 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:09:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2024-11-24 01:09:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2314. [2024-11-24 01:09:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2225 states have (on average 1.303820224719101) internal successors, (2901), 2227 states have internal predecessors, (2901), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-24 01:09:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3055 transitions. [2024-11-24 01:09:44,653 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3055 transitions. Word has length 158 [2024-11-24 01:09:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:44,657 INFO L471 AbstractCegarLoop]: Abstraction has 2314 states and 3055 transitions. [2024-11-24 01:09:44,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3055 transitions. [2024-11-24 01:09:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-24 01:09:44,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:44,660 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:44,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-24 01:09:44,660 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:44,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1807863380, now seen corresponding path program 1 times [2024-11-24 01:09:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:44,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403481054] [2024-11-24 01:09:44,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:44,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:47,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:47,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403481054] [2024-11-24 01:09:47,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403481054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:47,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:47,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-24 01:09:47,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568587521] [2024-11-24 01:09:47,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:47,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-24 01:09:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:47,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-24 01:09:47,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-24 01:09:47,135 INFO L87 Difference]: Start difference. First operand 2314 states and 3055 transitions. Second operand has 17 states, 16 states have (on average 4.1875) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:09:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:51,015 INFO L93 Difference]: Finished difference Result 4622 states and 6098 transitions. [2024-11-24 01:09:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:09:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.1875) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 159 [2024-11-24 01:09:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:51,022 INFO L225 Difference]: With dead ends: 4622 [2024-11-24 01:09:51,022 INFO L226 Difference]: Without dead ends: 2674 [2024-11-24 01:09:51,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2024-11-24 01:09:51,026 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 344 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:51,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1992 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-24 01:09:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-11-24 01:09:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2581. [2024-11-24 01:09:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 2451 states have (on average 1.2966136270909834) internal successors, (3178), 2456 states have internal predecessors, (3178), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:09:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3402 transitions. [2024-11-24 01:09:51,419 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3402 transitions. Word has length 159 [2024-11-24 01:09:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:51,420 INFO L471 AbstractCegarLoop]: Abstraction has 2581 states and 3402 transitions. [2024-11-24 01:09:51,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.1875) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-24 01:09:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3402 transitions. [2024-11-24 01:09:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-24 01:09:51,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:51,422 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:51,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-24 01:09:51,423 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:51,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:51,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1535555884, now seen corresponding path program 1 times [2024-11-24 01:09:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:51,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859814885] [2024-11-24 01:09:51,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:51,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859814885] [2024-11-24 01:09:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859814885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:09:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310891100] [2024-11-24 01:09:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:52,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:09:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:52,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:09:52,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:09:52,169 INFO L87 Difference]: Start difference. First operand 2581 states and 3402 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:52,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:52,998 INFO L93 Difference]: Finished difference Result 4958 states and 6540 transitions. [2024-11-24 01:09:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:09:52,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 159 [2024-11-24 01:09:52,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:53,002 INFO L225 Difference]: With dead ends: 4958 [2024-11-24 01:09:53,003 INFO L226 Difference]: Without dead ends: 2710 [2024-11-24 01:09:53,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:09:53,005 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 215 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:53,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 970 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-24 01:09:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2024-11-24 01:09:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2430. [2024-11-24 01:09:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2300 states have (on average 1.2969565217391303) internal successors, (2983), 2305 states have internal predecessors, (2983), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:09:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3207 transitions. [2024-11-24 01:09:53,283 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 3207 transitions. Word has length 159 [2024-11-24 01:09:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:53,284 INFO L471 AbstractCegarLoop]: Abstraction has 2430 states and 3207 transitions. [2024-11-24 01:09:53,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 3207 transitions. [2024-11-24 01:09:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-24 01:09:53,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:53,286 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-24 01:09:53,286 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:53,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash 603257263, now seen corresponding path program 1 times [2024-11-24 01:09:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:53,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939438383] [2024-11-24 01:09:53,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:53,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:54,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:54,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939438383] [2024-11-24 01:09:54,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939438383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:54,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:54,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 01:09:54,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486288266] [2024-11-24 01:09:54,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:54,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 01:09:54,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:54,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 01:09:54,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:09:54,191 INFO L87 Difference]: Start difference. First operand 2430 states and 3207 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-24 01:09:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:54,802 INFO L93 Difference]: Finished difference Result 6450 states and 8473 transitions. [2024-11-24 01:09:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:09:54,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 160 [2024-11-24 01:09:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:54,808 INFO L225 Difference]: With dead ends: 6450 [2024-11-24 01:09:54,808 INFO L226 Difference]: Without dead ends: 4264 [2024-11-24 01:09:54,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:09:54,811 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 426 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:54,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 816 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:09:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2024-11-24 01:09:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3359. [2024-11-24 01:09:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 3229 states have (on average 1.3041189222669558) internal successors, (4211), 3234 states have internal predecessors, (4211), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:09:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4435 transitions. [2024-11-24 01:09:55,237 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4435 transitions. Word has length 160 [2024-11-24 01:09:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:55,237 INFO L471 AbstractCegarLoop]: Abstraction has 3359 states and 4435 transitions. [2024-11-24 01:09:55,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-24 01:09:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4435 transitions. [2024-11-24 01:09:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-24 01:09:55,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:55,239 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:55,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-24 01:09:55,239 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:55,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:55,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1989460657, now seen corresponding path program 1 times [2024-11-24 01:09:55,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572802005] [2024-11-24 01:09:55,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:55,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:55,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572802005] [2024-11-24 01:09:55,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572802005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:55,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:55,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:09:55,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21575505] [2024-11-24 01:09:55,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:55,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:09:55,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:55,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:09:55,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:09:55,794 INFO L87 Difference]: Start difference. First operand 3359 states and 4435 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:56,477 INFO L93 Difference]: Finished difference Result 7302 states and 9596 transitions. [2024-11-24 01:09:56,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:09:56,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-24 01:09:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:56,484 INFO L225 Difference]: With dead ends: 7302 [2024-11-24 01:09:56,484 INFO L226 Difference]: Without dead ends: 4271 [2024-11-24 01:09:56,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:09:56,489 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 201 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:56,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 790 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:09:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2024-11-24 01:09:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3352. [2024-11-24 01:09:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.3026070763500932) internal successors, (4197), 3227 states have internal predecessors, (4197), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:09:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4421 transitions. [2024-11-24 01:09:56,912 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4421 transitions. Word has length 160 [2024-11-24 01:09:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:56,912 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4421 transitions. [2024-11-24 01:09:56,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4421 transitions. [2024-11-24 01:09:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-24 01:09:56,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:56,915 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:56,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-24 01:09:56,915 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:56,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash 459533258, now seen corresponding path program 1 times [2024-11-24 01:09:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:56,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665561943] [2024-11-24 01:09:56,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:56,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665561943] [2024-11-24 01:09:56,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665561943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:56,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:56,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:09:56,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67300378] [2024-11-24 01:09:56,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:56,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:09:56,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:56,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:09:56,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:09:56,995 INFO L87 Difference]: Start difference. First operand 3352 states and 4421 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:57,305 INFO L93 Difference]: Finished difference Result 6541 states and 8667 transitions. [2024-11-24 01:09:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:09:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-24 01:09:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:57,310 INFO L225 Difference]: With dead ends: 6541 [2024-11-24 01:09:57,310 INFO L226 Difference]: Without dead ends: 3445 [2024-11-24 01:09:57,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:09:57,313 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:57,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:09:57,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2024-11-24 01:09:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3445. [2024-11-24 01:09:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 3315 states have (on average 1.2941176470588236) internal successors, (4290), 3320 states have internal predecessors, (4290), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:09:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 4514 transitions. [2024-11-24 01:09:57,614 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 4514 transitions. Word has length 160 [2024-11-24 01:09:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:57,614 INFO L471 AbstractCegarLoop]: Abstraction has 3445 states and 4514 transitions. [2024-11-24 01:09:57,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 4514 transitions. [2024-11-24 01:09:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-24 01:09:57,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:57,616 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:57,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-24 01:09:57,617 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:57,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash 600081868, now seen corresponding path program 1 times [2024-11-24 01:09:57,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:57,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265926853] [2024-11-24 01:09:57,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:57,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:57,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265926853] [2024-11-24 01:09:57,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265926853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:57,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:57,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:09:57,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662857241] [2024-11-24 01:09:57,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:57,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:09:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:57,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:09:57,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:09:57,821 INFO L87 Difference]: Start difference. First operand 3445 states and 4514 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:58,101 INFO L93 Difference]: Finished difference Result 6553 states and 8517 transitions. [2024-11-24 01:09:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:09:58,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-24 01:09:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:58,106 INFO L225 Difference]: With dead ends: 6553 [2024-11-24 01:09:58,106 INFO L226 Difference]: Without dead ends: 3352 [2024-11-24 01:09:58,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:09:58,109 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:58,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:09:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2024-11-24 01:09:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3352. [2024-11-24 01:09:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.24487895716946) internal successors, (4011), 3227 states have internal predecessors, (4011), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:09:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4235 transitions. [2024-11-24 01:09:58,425 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4235 transitions. Word has length 160 [2024-11-24 01:09:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4235 transitions. [2024-11-24 01:09:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:09:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4235 transitions. [2024-11-24 01:09:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-24 01:09:58,427 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:58,428 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:58,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-24 01:09:58,428 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:58,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -795053308, now seen corresponding path program 1 times [2024-11-24 01:09:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:09:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478864250] [2024-11-24 01:09:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:09:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:09:59,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:09:59,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478864250] [2024-11-24 01:09:59,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478864250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:09:59,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:09:59,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 01:09:59,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624842984] [2024-11-24 01:09:59,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:09:59,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 01:09:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:09:59,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 01:09:59,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:09:59,104 INFO L87 Difference]: Start difference. First operand 3352 states and 4235 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-24 01:09:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:59,908 INFO L93 Difference]: Finished difference Result 6476 states and 8188 transitions. [2024-11-24 01:09:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:09:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 161 [2024-11-24 01:09:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:59,913 INFO L225 Difference]: With dead ends: 6476 [2024-11-24 01:09:59,913 INFO L226 Difference]: Without dead ends: 3452 [2024-11-24 01:09:59,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:09:59,917 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 406 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:59,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 755 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:09:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2024-11-24 01:10:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3352. [2024-11-24 01:10:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.2405338299193047) internal successors, (3997), 3227 states have internal predecessors, (3997), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:10:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4221 transitions. [2024-11-24 01:10:00,257 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4221 transitions. Word has length 161 [2024-11-24 01:10:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:00,257 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4221 transitions. [2024-11-24 01:10:00,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-24 01:10:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4221 transitions. [2024-11-24 01:10:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-24 01:10:00,259 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:00,259 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:00,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-24 01:10:00,259 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:00,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1188080318, now seen corresponding path program 1 times [2024-11-24 01:10:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589147232] [2024-11-24 01:10:00,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589147232] [2024-11-24 01:10:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589147232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:00,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:00,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:10:00,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024524324] [2024-11-24 01:10:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:00,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:10:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:00,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:10:00,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:10:00,624 INFO L87 Difference]: Start difference. First operand 3352 states and 4221 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:01,151 INFO L93 Difference]: Finished difference Result 6420 states and 8083 transitions. [2024-11-24 01:10:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:10:01,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-24 01:10:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:01,155 INFO L225 Difference]: With dead ends: 6420 [2024-11-24 01:10:01,155 INFO L226 Difference]: Without dead ends: 3396 [2024-11-24 01:10:01,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:10:01,158 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 287 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:01,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 538 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:10:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2024-11-24 01:10:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3352. [2024-11-24 01:10:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.2383612662942272) internal successors, (3990), 3227 states have internal predecessors, (3990), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:10:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4214 transitions. [2024-11-24 01:10:01,525 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4214 transitions. Word has length 161 [2024-11-24 01:10:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:01,525 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4214 transitions. [2024-11-24 01:10:01,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4214 transitions. [2024-11-24 01:10:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-24 01:10:01,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:01,527 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:01,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-24 01:10:01,527 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1266035031, now seen corresponding path program 1 times [2024-11-24 01:10:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110654848] [2024-11-24 01:10:01,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:01,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110654848] [2024-11-24 01:10:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110654848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:10:01,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880960469] [2024-11-24 01:10:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:01,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:10:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:01,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:10:01,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:10:01,974 INFO L87 Difference]: Start difference. First operand 3352 states and 4214 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:10:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:02,677 INFO L93 Difference]: Finished difference Result 5437 states and 6826 transitions. [2024-11-24 01:10:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:10:02,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2024-11-24 01:10:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:02,684 INFO L225 Difference]: With dead ends: 5437 [2024-11-24 01:10:02,685 INFO L226 Difference]: Without dead ends: 3426 [2024-11-24 01:10:02,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:10:02,689 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 319 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:02,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 514 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:10:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2024-11-24 01:10:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3352. [2024-11-24 01:10:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.2262569832402235) internal successors, (3951), 3227 states have internal predecessors, (3951), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:10:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4175 transitions. [2024-11-24 01:10:02,984 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4175 transitions. Word has length 161 [2024-11-24 01:10:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:02,984 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4175 transitions. [2024-11-24 01:10:02,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:10:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4175 transitions. [2024-11-24 01:10:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-24 01:10:02,987 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:02,987 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:02,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-24 01:10:02,987 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:02,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1400048537, now seen corresponding path program 1 times [2024-11-24 01:10:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:02,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044541047] [2024-11-24 01:10:02,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044541047] [2024-11-24 01:10:03,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044541047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:03,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:03,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:10:03,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858964622] [2024-11-24 01:10:03,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:03,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:10:03,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:03,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:10:03,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:10:03,232 INFO L87 Difference]: Start difference. First operand 3352 states and 4175 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:03,994 INFO L93 Difference]: Finished difference Result 7349 states and 9110 transitions. [2024-11-24 01:10:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:10:03,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-24 01:10:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:03,999 INFO L225 Difference]: With dead ends: 7349 [2024-11-24 01:10:03,999 INFO L226 Difference]: Without dead ends: 4325 [2024-11-24 01:10:04,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:10:04,003 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 116 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:04,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 822 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:10:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4325 states. [2024-11-24 01:10:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4325 to 3826. [2024-11-24 01:10:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3826 states, 3696 states have (on average 1.2126623376623376) internal successors, (4482), 3701 states have internal predecessors, (4482), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:10:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4706 transitions. [2024-11-24 01:10:04,316 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4706 transitions. Word has length 161 [2024-11-24 01:10:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:04,317 INFO L471 AbstractCegarLoop]: Abstraction has 3826 states and 4706 transitions. [2024-11-24 01:10:04,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4706 transitions. [2024-11-24 01:10:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-24 01:10:04,319 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:04,319 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:04,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-24 01:10:04,319 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:04,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:04,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1141883099, now seen corresponding path program 1 times [2024-11-24 01:10:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460683116] [2024-11-24 01:10:04,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:04,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-24 01:10:04,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:04,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460683116] [2024-11-24 01:10:04,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460683116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:04,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232703013] [2024-11-24 01:10:04,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:04,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:04,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:04,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:04,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 01:10:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:04,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-24 01:10:04,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:04,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:10:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232703013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:04,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:10:04,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2024-11-24 01:10:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196685256] [2024-11-24 01:10:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:04,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:10:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:04,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:10:04,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:10:04,973 INFO L87 Difference]: Start difference. First operand 3826 states and 4706 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:05,361 INFO L93 Difference]: Finished difference Result 7381 states and 9090 transitions. [2024-11-24 01:10:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:10:05,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-24 01:10:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:05,366 INFO L225 Difference]: With dead ends: 7381 [2024-11-24 01:10:05,366 INFO L226 Difference]: Without dead ends: 3919 [2024-11-24 01:10:05,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:10:05,369 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:05,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1013 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:10:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-11-24 01:10:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3823. [2024-11-24 01:10:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3823 states, 3693 states have (on average 1.2128350934199839) internal successors, (4479), 3698 states have internal predecessors, (4479), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-24 01:10:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 4703 transitions. [2024-11-24 01:10:05,654 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 4703 transitions. Word has length 161 [2024-11-24 01:10:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:05,654 INFO L471 AbstractCegarLoop]: Abstraction has 3823 states and 4703 transitions. [2024-11-24 01:10:05,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:05,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 4703 transitions. [2024-11-24 01:10:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-24 01:10:05,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:05,658 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:05,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-24 01:10:05,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:05,858 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:05,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash -991275417, now seen corresponding path program 1 times [2024-11-24 01:10:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966846940] [2024-11-24 01:10:05,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-24 01:10:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966846940] [2024-11-24 01:10:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966846940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166869208] [2024-11-24 01:10:06,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:06,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:06,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:06,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:10:06,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 01:10:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:07,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-24 01:10:07,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:07,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-24 01:10:07,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-24 01:10:08,363 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-24 01:10:08,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2024-11-24 01:10:08,395 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-24 01:10:08,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-24 01:10:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 312 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-24 01:10:08,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166869208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:08,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:10:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2024-11-24 01:10:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975149248] [2024-11-24 01:10:08,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:10:08,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 01:10:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:08,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 01:10:08,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-24 01:10:08,817 INFO L87 Difference]: Start difference. First operand 3823 states and 4703 transitions. Second operand has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-24 01:10:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:10,122 INFO L93 Difference]: Finished difference Result 7942 states and 9737 transitions. [2024-11-24 01:10:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 01:10:10,123 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 161 [2024-11-24 01:10:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:10,133 INFO L225 Difference]: With dead ends: 7942 [2024-11-24 01:10:10,133 INFO L226 Difference]: Without dead ends: 4339 [2024-11-24 01:10:10,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-24 01:10:10,139 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 660 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:10,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1531 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 01:10:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2024-11-24 01:10:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 4288. [2024-11-24 01:10:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4288 states, 4122 states have (on average 1.1887433284813198) internal successors, (4900), 4134 states have internal predecessors, (4900), 140 states have call successors, (140), 25 states have call predecessors, (140), 25 states have return successors, (140), 128 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-24 01:10:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 5180 transitions. [2024-11-24 01:10:10,591 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 5180 transitions. Word has length 161 [2024-11-24 01:10:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:10,591 INFO L471 AbstractCegarLoop]: Abstraction has 4288 states and 5180 transitions. [2024-11-24 01:10:10,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-24 01:10:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 5180 transitions. [2024-11-24 01:10:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-24 01:10:10,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:10,593 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:10,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-24 01:10:10,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:10:10,794 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:10,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:10,794 INFO L85 PathProgramCache]: Analyzing trace with hash 242058368, now seen corresponding path program 1 times [2024-11-24 01:10:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:10,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722671822] [2024-11-24 01:10:10,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:10,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:11,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:10:11,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722671822] [2024-11-24 01:10:11,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722671822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:11,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:11,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 01:10:11,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857087666] [2024-11-24 01:10:11,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:11,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:10:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:10:11,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:10:11,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:10:11,722 INFO L87 Difference]: Start difference. First operand 4288 states and 5180 transitions. Second operand has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-24 01:10:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:12,933 INFO L93 Difference]: Finished difference Result 4679 states and 5646 transitions. [2024-11-24 01:10:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 01:10:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2024-11-24 01:10:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:12,941 INFO L225 Difference]: With dead ends: 4679 [2024-11-24 01:10:12,941 INFO L226 Difference]: Without dead ends: 4677 [2024-11-24 01:10:12,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2024-11-24 01:10:12,944 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 329 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:12,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1550 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-24 01:10:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4677 states. [2024-11-24 01:10:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4677 to 4666. [2024-11-24 01:10:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4666 states, 4479 states have (on average 1.1879883902656843) internal successors, (5321), 4498 states have internal predecessors, (5321), 154 states have call successors, (154), 32 states have call predecessors, (154), 32 states have return successors, (154), 135 states have call predecessors, (154), 154 states have call successors, (154) [2024-11-24 01:10:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 5629 transitions. [2024-11-24 01:10:13,466 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 5629 transitions. Word has length 163 [2024-11-24 01:10:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:13,467 INFO L471 AbstractCegarLoop]: Abstraction has 4666 states and 5629 transitions. [2024-11-24 01:10:13,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-24 01:10:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 5629 transitions. [2024-11-24 01:10:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-24 01:10:13,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:13,469 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:13,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-24 01:10:13,470 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:13,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1822060643, now seen corresponding path program 1 times [2024-11-24 01:10:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:10:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219552075] [2024-11-24 01:10:13,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:10:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:10:13,551 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:10:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:10:13,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:10:13,783 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:10:13,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:10:13,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-24 01:10:13,791 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:14,054 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:10:14,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:10:14 BoogieIcfgContainer [2024-11-24 01:10:14,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:10:14,059 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:10:14,059 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:10:14,060 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:10:14,061 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:06:23" (3/4) ... [2024-11-24 01:10:14,064 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 01:10:14,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:10:14,065 INFO L158 Benchmark]: Toolchain (without parser) took 232733.41ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 92.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 352.9MB. Max. memory is 16.1GB. [2024-11-24 01:10:14,065 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:10:14,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.12ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 01:10:14,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.08ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 71.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:10:14,065 INFO L158 Benchmark]: Boogie Preprocessor took 104.10ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 66.6MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:10:14,065 INFO L158 Benchmark]: RCFGBuilder took 1256.69ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 76.2MB in the end (delta: -9.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-11-24 01:10:14,066 INFO L158 Benchmark]: TraceAbstraction took 230873.10ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 75.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 337.7MB. Max. memory is 16.1GB. [2024-11-24 01:10:14,066 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 225.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:10:14,067 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.51ms. Allocated memory is still 117.4MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.12ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.08ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 71.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.10ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 66.6MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1256.69ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 76.2MB in the end (delta: -9.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 230873.10ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 75.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 337.7MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 225.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[2]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[3]); [L29] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer = &(BOOL_unsigned_char_Array_0[4]); [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L33] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0][0]); [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1][0]); [L44] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[0][1]); [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer = &(unsigned_char_Array_0[1][1]); [L46] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer = &(unsigned_char_Array_0[0][2]); [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer = &(unsigned_char_Array_0[1][2]); [L48] unsigned char last_1_unsigned_char_Array_0_0__1_ = 64; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L122] isInitial = 1 [L123] FCALL initially() [L125] CALL updateLastVariables() [L115] EXPR unsigned_char_Array_0[0][1] [L115] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L84] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L87] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L90] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L91] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L93] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L94] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L96] double_Array_0[1] = __VERIFIER_nondet_double() [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L98] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L99] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] CALL assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] RET assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L101] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L102] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L104] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L107] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L108] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L110] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L111] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L126] RET updateVariables() [L127] CALL step() [L52] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] COND TRUE (last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_ [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) = (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L57] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L60] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L61] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) [L68] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L68] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) [L73] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L73] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)); [L74] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L74] unsigned char stepLocal_0 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)); [L75] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L75] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, stepLocal_1=64, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] COND TRUE stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L77] COND TRUE stepLocal_1 > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) [L78] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L78] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118-L119] return (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 230.5s, OverallIterations: 56, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 96.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15888 SdHoareTripleChecker+Valid, 38.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15863 mSDsluCounter, 61072 SdHoareTripleChecker+Invalid, 34.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50133 mSDsCounter, 1917 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29506 IncrementalHoareTripleChecker+Invalid, 31423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1917 mSolverCounterUnsat, 10939 mSDtfsCounter, 29506 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1791 GetRequests, 1097 SyntacticMatches, 6 SemanticMatches, 688 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2534 ImplicationChecksByTransitivity, 65.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4666occurred in iteration=55, InterpolantAutomatonStates: 486, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.5s AutomataMinimizationTime, 55 MinimizatonAttempts, 9800 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 115.4s InterpolantComputationTime, 9505 NumberOfCodeBlocks, 9505 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 9282 ConstructedInterpolants, 0 QuantifiedInterpolants, 76836 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2879 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 60 InterpolantComputations, 54 PerfectInterpolantSequences, 40491/41040 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 01:10:14,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/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: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC --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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:10:17,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:10:17,220 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 01:10:17,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:10:17,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:10:17,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:10:17,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:10:17,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:10:17,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:10:17,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:10:17,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:10:17,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:10:17,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:10:17,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:10:17,299 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:10:17,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:10:17,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:10:17,300 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:10:17,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:10:17,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:10:17,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:10:17,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:10:17,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:10:17,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:10:17,301 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 01:10:17,301 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 01:10:17,301 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:10:17,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:10:17,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:10:17,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:10:17,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:10:17,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:10:17,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:10:17,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:10:17,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:10:17,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:10:17,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:10:17,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:10:17,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:10:17,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:10:17,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:10:17,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:10:17,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:10:17,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:10:17,304 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 01:10:17,304 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 01:10:17,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:10:17,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:10:17,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:10:17,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:10:17,304 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC 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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2024-11-24 01:10:17,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:10:17,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:10:17,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:10:17,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:10:17,678 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:10:17,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-24 01:10:21,118 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data/fd7db2732/d99935acd77740979d1262710fa00379/FLAGe3d237ee7 [2024-11-24 01:10:21,508 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:10:21,509 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-24 01:10:21,522 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data/fd7db2732/d99935acd77740979d1262710fa00379/FLAGe3d237ee7 [2024-11-24 01:10:21,547 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/data/fd7db2732/d99935acd77740979d1262710fa00379 [2024-11-24 01:10:21,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:10:21,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:10:21,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:10:21,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:10:21,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:10:21,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56134380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:21, skipping insertion in model container [2024-11-24 01:10:21,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:21" (1/1) ... [2024-11-24 01:10:21,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:10:21,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-24 01:10:21,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:10:21,977 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:10:21,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-24 01:10:22,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:10:22,121 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:10:22,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22 WrapperNode [2024-11-24 01:10:22,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:10:22,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:10:22,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:10:22,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:10:22,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,203 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 559 [2024-11-24 01:10:22,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:10:22,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:10:22,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:10:22,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:10:22,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,263 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2024-11-24 01:10:22,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:10:22,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:10:22,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:10:22,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:10:22,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (1/1) ... [2024-11-24 01:10:22,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:10:22,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:10:22,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:10:22,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:10:22,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:10:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-24 01:10:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-24 01:10:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-24 01:10:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-24 01:10:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-24 01:10:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-24 01:10:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-24 01:10:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-24 01:10:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-24 01:10:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-24 01:10:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-24 01:10:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-24 01:10:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-24 01:10:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-24 01:10:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-24 01:10:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 01:10:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-24 01:10:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-24 01:10:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-24 01:10:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-24 01:10:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-24 01:10:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-24 01:10:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-24 01:10:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-24 01:10:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-24 01:10:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:10:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:10:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:10:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:10:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-24 01:10:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-24 01:10:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-24 01:10:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-24 01:10:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-24 01:10:22,633 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:10:22,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:10:23,522 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-24 01:10:23,522 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:10:23,541 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:10:23,542 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:10:23,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:23 BoogieIcfgContainer [2024-11-24 01:10:23,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:10:23,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:10:23,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:10:23,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:10:23,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:10:21" (1/3) ... [2024-11-24 01:10:23,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7109d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:23, skipping insertion in model container [2024-11-24 01:10:23,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:22" (2/3) ... [2024-11-24 01:10:23,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7109d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:23, skipping insertion in model container [2024-11-24 01:10:23,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:23" (3/3) ... [2024-11-24 01:10:23,559 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-24 01:10:23,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:10:23,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-56.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:10:23,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:10:23,690 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;@3126c9a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:10:23,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:10:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-24 01:10:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-24 01:10:23,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:23,719 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:23,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:23,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:23,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1859210493, now seen corresponding path program 1 times [2024-11-24 01:10:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:10:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581256647] [2024-11-24 01:10:23,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:23,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:23,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:10:23,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:10:23,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-24 01:10:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:24,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:10:24,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-24 01:10:24,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:10:24,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:10:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581256647] [2024-11-24 01:10:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581256647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:24,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:10:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188226679] [2024-11-24 01:10:24,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:24,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:10:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:10:24,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:10:24,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:10:24,407 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:10:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:24,462 INFO L93 Difference]: Finished difference Result 229 states and 363 transitions. [2024-11-24 01:10:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:10:24,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-24 01:10:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:24,478 INFO L225 Difference]: With dead ends: 229 [2024-11-24 01:10:24,478 INFO L226 Difference]: Without dead ends: 114 [2024-11-24 01:10:24,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:10:24,487 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:24,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:10:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-24 01:10:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-24 01:10:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-24 01:10:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 168 transitions. [2024-11-24 01:10:24,557 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 168 transitions. Word has length 149 [2024-11-24 01:10:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:24,557 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 168 transitions. [2024-11-24 01:10:24,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-24 01:10:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 168 transitions. [2024-11-24 01:10:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-24 01:10:24,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:24,564 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:24,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-24 01:10:24,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:24,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:24,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:24,767 INFO L85 PathProgramCache]: Analyzing trace with hash -187480061, now seen corresponding path program 1 times [2024-11-24 01:10:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:10:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197397017] [2024-11-24 01:10:24,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:24,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:24,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:10:24,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:10:24,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-24 01:10:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:25,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 01:10:25,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:25,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:10:25,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:10:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197397017] [2024-11-24 01:10:25,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197397017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:25,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:10:25,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:10:25,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053052919] [2024-11-24 01:10:25,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:25,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:10:25,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:10:25,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:10:25,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:25,330 INFO L87 Difference]: Start difference. First operand 114 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:25,389 INFO L93 Difference]: Finished difference Result 226 states and 335 transitions. [2024-11-24 01:10:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:10:25,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-24 01:10:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:25,392 INFO L225 Difference]: With dead ends: 226 [2024-11-24 01:10:25,393 INFO L226 Difference]: Without dead ends: 115 [2024-11-24 01:10:25,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:10:25,394 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:25,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:10:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-24 01:10:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-24 01:10:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-24 01:10:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-11-24 01:10:25,412 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 149 [2024-11-24 01:10:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:25,415 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-11-24 01:10:25,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-11-24 01:10:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-24 01:10:25,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:25,422 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:25,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-24 01:10:25,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:25,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:25,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1876423803, now seen corresponding path program 1 times [2024-11-24 01:10:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:10:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322736194] [2024-11-24 01:10:25,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:25,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:25,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:10:25,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:10:25,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-24 01:10:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:26,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-24 01:10:26,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:26,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-24 01:10:28,480 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 19 treesize of output 15 [2024-11-24 01:10:28,637 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 24 treesize of output 16 [2024-11-24 01:10:28,710 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 39 treesize of output 27 [2024-11-24 01:10:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 35 proven. 384 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-24 01:10:28,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:29,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:10:29,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322736194] [2024-11-24 01:10:29,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322736194] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:29,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:10:29,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20] total 26 [2024-11-24 01:10:29,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809304943] [2024-11-24 01:10:29,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:29,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:10:29,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:10:29,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:10:29,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-11-24 01:10:29,457 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:30,390 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2024-11-24 01:10:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:10:30,392 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-24 01:10:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:30,395 INFO L225 Difference]: With dead ends: 312 [2024-11-24 01:10:30,398 INFO L226 Difference]: Without dead ends: 200 [2024-11-24 01:10:30,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2024-11-24 01:10:30,401 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 117 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:30,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1266 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 01:10:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-24 01:10:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-11-24 01:10:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 166 states have (on average 1.4096385542168675) internal successors, (234), 167 states have internal predecessors, (234), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-24 01:10:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2024-11-24 01:10:30,443 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 149 [2024-11-24 01:10:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:30,446 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2024-11-24 01:10:30,446 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2024-11-24 01:10:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-24 01:10:30,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:30,453 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:30,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-24 01:10:30,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:30,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1995841667, now seen corresponding path program 1 times [2024-11-24 01:10:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:10:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928496152] [2024-11-24 01:10:30,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:30,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:30,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:10:30,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:10:30,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-24 01:10:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:31,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-24 01:10:31,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:31,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-24 01:10:36,117 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 19 treesize of output 15 [2024-11-24 01:10:36,286 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-24 01:10:36,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2024-11-24 01:10:36,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:10:36,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2024-11-24 01:10:36,672 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 39 treesize of output 27 [2024-11-24 01:10:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 35 proven. 384 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-24 01:10:36,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:37,308 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 87 treesize of output 83 [2024-11-24 01:10:37,854 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:10:37,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928496152] [2024-11-24 01:10:37,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928496152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:37,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [22400606] [2024-11-24 01:10:37,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:37,855 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-24 01:10:37,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 [2024-11-24 01:10:37,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-24 01:10:37,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-24 01:10:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:38,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-24 01:10:38,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:38,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-24 01:10:41,914 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 19 treesize of output 15 [2024-11-24 01:10:42,112 INFO L349 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2024-11-24 01:10:42,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2024-11-24 01:10:42,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-24 01:10:42,475 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 39 treesize of output 27 [2024-11-24 01:10:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:42,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:10:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [22400606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:10:42,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:10:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [21] total 28 [2024-11-24 01:10:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433324898] [2024-11-24 01:10:42,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:42,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 01:10:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:10:42,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 01:10:42,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2024-11-24 01:10:42,623 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:47,454 INFO L93 Difference]: Finished difference Result 881 states and 1298 transitions. [2024-11-24 01:10:47,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-24 01:10:47,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-24 01:10:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:47,467 INFO L225 Difference]: With dead ends: 881 [2024-11-24 01:10:47,468 INFO L226 Difference]: Without dead ends: 687 [2024-11-24 01:10:47,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=477, Invalid=2385, Unknown=0, NotChecked=0, Total=2862 [2024-11-24 01:10:47,471 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1357 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:47,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 1437 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-24 01:10:47,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-24 01:10:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 421. [2024-11-24 01:10:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 360 states have (on average 1.4416666666666667) internal successors, (519), 362 states have internal predecessors, (519), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-24 01:10:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 631 transitions. [2024-11-24 01:10:47,531 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 631 transitions. Word has length 149 [2024-11-24 01:10:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:47,532 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 631 transitions. [2024-11-24 01:10:47,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 631 transitions. [2024-11-24 01:10:47,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-24 01:10:47,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:47,535 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:47,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-24 01:10:47,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-24 01:10:47,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt [2024-11-24 01:10:47,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:47,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash 985722527, now seen corresponding path program 1 times [2024-11-24 01:10:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:10:47,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709990552] [2024-11-24 01:10:47,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:47,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:10:47,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:10:47,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-24 01:10:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:48,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-24 01:10:48,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:48,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-24 01:10:49,718 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 22 treesize of output 14 [2024-11-24 01:10:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 35 proven. 384 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-24 01:10:49,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:50,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:10:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709990552] [2024-11-24 01:10:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709990552] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:50,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:10:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-24 01:10:50,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768479016] [2024-11-24 01:10:50,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:50,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:10:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:10:50,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:10:50,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-24 01:10:50,051 INFO L87 Difference]: Start difference. First operand 421 states and 631 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:50,198 INFO L93 Difference]: Finished difference Result 880 states and 1321 transitions. [2024-11-24 01:10:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:10:50,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-24 01:10:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:50,204 INFO L225 Difference]: With dead ends: 880 [2024-11-24 01:10:50,204 INFO L226 Difference]: Without dead ends: 462 [2024-11-24 01:10:50,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-24 01:10:50,211 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 142 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:50,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 510 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:10:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-24 01:10:50,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 428. [2024-11-24 01:10:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 367 states have (on average 1.435967302452316) internal successors, (527), 369 states have internal predecessors, (527), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-24 01:10:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 639 transitions. [2024-11-24 01:10:50,278 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 639 transitions. Word has length 150 [2024-11-24 01:10:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:50,279 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 639 transitions. [2024-11-24 01:10:50,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 639 transitions. [2024-11-24 01:10:50,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-24 01:10:50,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:50,281 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:50,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-24 01:10:50,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:50,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:50,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1804936461, now seen corresponding path program 1 times [2024-11-24 01:10:50,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:10:50,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923368796] [2024-11-24 01:10:50,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:50,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:50,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:10:50,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:10:50,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-24 01:10:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:50,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-24 01:10:50,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:10:50,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-24 01:10:51,563 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 23 treesize of output 15 [2024-11-24 01:10:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-24 01:10:51,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-24 01:10:51,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:10:51,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923368796] [2024-11-24 01:10:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923368796] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 01:10:51,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:10:51,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-24 01:10:51,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533013411] [2024-11-24 01:10:51,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:10:51,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:10:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:10:51,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:10:51,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-24 01:10:51,867 INFO L87 Difference]: Start difference. First operand 428 states and 639 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:10:52,121 INFO L93 Difference]: Finished difference Result 902 states and 1345 transitions. [2024-11-24 01:10:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:10:52,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-24 01:10:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:10:52,126 INFO L225 Difference]: With dead ends: 902 [2024-11-24 01:10:52,126 INFO L226 Difference]: Without dead ends: 477 [2024-11-24 01:10:52,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:10:52,132 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 145 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:10:52,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 648 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:10:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-24 01:10:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 423. [2024-11-24 01:10:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 362 states have (on average 1.4281767955801106) internal successors, (517), 364 states have internal predecessors, (517), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-24 01:10:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 629 transitions. [2024-11-24 01:10:52,181 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 629 transitions. Word has length 150 [2024-11-24 01:10:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:10:52,182 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 629 transitions. [2024-11-24 01:10:52,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-24 01:10:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 629 transitions. [2024-11-24 01:10:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-24 01:10:52,185 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:10:52,185 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:10:52,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-24 01:10:52,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:52,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:10:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:10:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 31387903, now seen corresponding path program 1 times [2024-11-24 01:10:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:10:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103269769] [2024-11-24 01:10:52,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:10:52,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:10:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:10:52,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:10:52,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-24 01:10:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:10:52,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-24 01:10:52,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:00,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-24 01:11:01,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-24 01:11:04,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2024-11-24 01:11:06,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2024-11-24 01:11:12,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 95 [2024-11-24 01:11:14,078 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 45 treesize of output 33 [2024-11-24 01:11:14,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:11:14,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 63 [2024-11-24 01:11:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 91 proven. 437 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-24 01:11:15,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:11:20,881 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:11:20,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103269769] [2024-11-24 01:11:20,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103269769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:20,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [643862781] [2024-11-24 01:11:20,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:20,881 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-24 01:11:20,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 [2024-11-24 01:11:20,883 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-24 01:11:20,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-24 01:11:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:21,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-24 01:11:21,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:27,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-11-24 01:11:29,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2024-11-24 01:11:31,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-24 01:11:34,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2024-11-24 01:11:41,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 107 [2024-11-24 01:11:44,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 79 [2024-11-24 01:11:45,735 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 45 treesize of output 33 [2024-11-24 01:11:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 300 proven. 148 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-24 01:11:47,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:11:55,111 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 69 treesize of output 57 [2024-11-24 01:11:56,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [643862781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:11:56,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:11:56,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 32] total 73 [2024-11-24 01:11:56,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959996576] [2024-11-24 01:11:56,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:11:56,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-24 01:11:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:11:56,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-24 01:11:56,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=9302, Unknown=0, NotChecked=0, Total=9900 [2024-11-24 01:11:56,216 INFO L87 Difference]: Start difference. First operand 423 states and 629 transitions. Second operand has 74 states, 65 states have (on average 2.4307692307692306) internal successors, (158), 64 states have internal predecessors, (158), 18 states have call successors, (38), 12 states have call predecessors, (38), 18 states have return successors, (38), 15 states have call predecessors, (38), 18 states have call successors, (38) [2024-11-24 01:12:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:12:51,154 INFO L93 Difference]: Finished difference Result 963 states and 1405 transitions. [2024-11-24 01:12:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-24 01:12:51,155 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 65 states have (on average 2.4307692307692306) internal successors, (158), 64 states have internal predecessors, (158), 18 states have call successors, (38), 12 states have call predecessors, (38), 18 states have return successors, (38), 15 states have call predecessors, (38), 18 states have call successors, (38) Word has length 151 [2024-11-24 01:12:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:12:51,158 INFO L225 Difference]: With dead ends: 963 [2024-11-24 01:12:51,158 INFO L226 Difference]: Without dead ends: 543 [2024-11-24 01:12:51,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5994 ImplicationChecksByTransitivity, 66.0s TimeCoverageRelationStatistics Valid=2423, Invalid=20833, Unknown=0, NotChecked=0, Total=23256 [2024-11-24 01:12:51,165 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 1704 mSDsluCounter, 7824 mSDsCounter, 0 mSdLazyCounter, 6370 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 8022 SdHoareTripleChecker+Invalid, 6795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 6370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:12:51,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 8022 Invalid, 6795 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [425 Valid, 6370 Invalid, 0 Unknown, 0 Unchecked, 23.6s Time] [2024-11-24 01:12:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-24 01:12:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 468. [2024-11-24 01:12:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 401 states have (on average 1.4139650872817955) internal successors, (567), 403 states have internal predecessors, (567), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-24 01:12:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 679 transitions. [2024-11-24 01:12:51,236 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 679 transitions. Word has length 151 [2024-11-24 01:12:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:12:51,236 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 679 transitions. [2024-11-24 01:12:51,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 65 states have (on average 2.4307692307692306) internal successors, (158), 64 states have internal predecessors, (158), 18 states have call successors, (38), 12 states have call predecessors, (38), 18 states have return successors, (38), 15 states have call predecessors, (38), 18 states have call successors, (38) [2024-11-24 01:12:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 679 transitions. [2024-11-24 01:12:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-24 01:12:51,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:12:51,239 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:12:51,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-11-24 01:12:51,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-24 01:12:51,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:12:51,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:12:51,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:12:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash -391313923, now seen corresponding path program 1 times [2024-11-24 01:12:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:12:51,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590450620] [2024-11-24 01:12:51,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:12:51,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:12:51,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:12:51,647 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:12:51,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_296c1ef5-e311-4edd-ab3e-73aa0902f7d7/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-24 01:12:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:12:52,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-24 01:12:52,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:12:52,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-24 01:12:59,261 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 8 treesize of output 1 [2024-11-24 01:13:00,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-24 01:13:03,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2024-11-24 01:13:03,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2024-11-24 01:13:03,946 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 51 treesize of output 39 [2024-11-24 01:13:04,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:13:04,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 49 [2024-11-24 01:13:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 52 proven. 434 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-24 01:13:04,497 INFO L312 TraceCheckSpWp]: Computing backward predicates...