./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme --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 ce7290e6713376455badf7100d5aceeca845cede6d066d71203baae97fa0e235 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:46:28,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:46:28,519 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:46:28,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:46:28,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:46:28,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:46:28,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:46:28,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:46:28,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:46:28,582 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:46:28,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:46:28,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:46:28,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:46:28,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:46:28,587 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:46:28,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:46:28,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:46:28,589 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:46:28,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:46:28,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:46:28,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:46:28,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:46:28,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:46:28,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:46:28,593 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:46:28,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:46:28,594 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:46:28,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:46:28,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:46:28,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:46:28,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:46:28,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:46:28,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:46:28,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:46:28,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:46:28,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:46:28,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:46:28,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:46:28,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:46:28,600 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:46:28,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:46:28,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:46:28,601 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme 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 -> ce7290e6713376455badf7100d5aceeca845cede6d066d71203baae97fa0e235 [2023-11-26 11:46:28,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:46:28,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:46:28,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:46:28,960 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:46:28,960 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:46:28,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i [2023-11-26 11:46:32,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:46:32,355 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:46:32,356 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i [2023-11-26 11:46:32,366 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/data/9ac3dbac9/f965618fcccc424c961d2eee3a275c9c/FLAGf7390a746 [2023-11-26 11:46:32,383 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/data/9ac3dbac9/f965618fcccc424c961d2eee3a275c9c [2023-11-26 11:46:32,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:46:32,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:46:32,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:46:32,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:46:32,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:46:32,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552e5819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32, skipping insertion in model container [2023-11-26 11:46:32,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,429 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:46:32,611 WARN L240 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_ae00df1b-734d-4c67-b8e6-18a0c0924db9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i[915,928] [2023-11-26 11:46:32,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:46:32,685 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:46:32,698 WARN L240 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_ae00df1b-734d-4c67-b8e6-18a0c0924db9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i[915,928] [2023-11-26 11:46:32,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:46:32,757 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:46:32,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32 WrapperNode [2023-11-26 11:46:32,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:46:32,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:46:32,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:46:32,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:46:32,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,833 INFO L138 Inliner]: procedures = 29, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 594 [2023-11-26 11:46:32,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:46:32,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:46:32,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:46:32,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:46:32,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,886 INFO L175 MemorySlicer]: Split 151 memory accesses to 15 slices as follows [2, 5, 8, 10, 5, 10, 8, 12, 8, 8, 5, 14, 14, 12, 30]. 20 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1]. [2023-11-26 11:46:32,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:46:32,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:46:32,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:46:32,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:46:32,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (1/1) ... [2023-11-26 11:46:32,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:46:33,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:46:33,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:46:33,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:46:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:46:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-26 11:46:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-26 11:46:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-26 11:46:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-11-26 11:46:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-11-26 11:46:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-11-26 11:46:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-11-26 11:46:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-11-26 11:46:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-11-26 11:46:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-11-26 11:46:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-11-26 11:46:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-11-26 11:46:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-11-26 11:46:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2023-11-26 11:46:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2023-11-26 11:46:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:46:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:46:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:46:33,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:46:33,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 11:46:33,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-26 11:46:33,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-26 11:46:33,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-26 11:46:33,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-26 11:46:33,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-26 11:46:33,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-26 11:46:33,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-26 11:46:33,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-26 11:46:33,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-26 11:46:33,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-26 11:46:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-26 11:46:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-26 11:46:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-26 11:46:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-11-26 11:46:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-11-26 11:46:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-11-26 11:46:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-11-26 11:46:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-11-26 11:46:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-11-26 11:46:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-11-26 11:46:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-11-26 11:46:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-11-26 11:46:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-11-26 11:46:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2023-11-26 11:46:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2023-11-26 11:46:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:46:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:46:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 11:46:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 11:46:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 11:46:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-26 11:46:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-26 11:46:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-26 11:46:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-26 11:46:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-26 11:46:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-26 11:46:33,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-26 11:46:33,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-26 11:46:33,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-26 11:46:33,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-26 11:46:33,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-26 11:46:33,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-26 11:46:33,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-26 11:46:33,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-11-26 11:46:33,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-11-26 11:46:33,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-11-26 11:46:33,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-11-26 11:46:33,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-11-26 11:46:33,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-11-26 11:46:33,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-11-26 11:46:33,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-11-26 11:46:33,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-11-26 11:46:33,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-11-26 11:46:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2023-11-26 11:46:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2023-11-26 11:46:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:46:33,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:46:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:46:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:46:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:46:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:46:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 11:46:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-26 11:46:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-26 11:46:33,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-26 11:46:33,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-26 11:46:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-26 11:46:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-26 11:46:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-26 11:46:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-26 11:46:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-26 11:46:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-26 11:46:33,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:46:33,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:46:33,419 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:46:33,422 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:46:34,241 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:46:34,286 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:46:34,286 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:46:34,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:46:34 BoogieIcfgContainer [2023-11-26 11:46:34,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:46:34,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:46:34,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:46:34,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:46:34,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:46:32" (1/3) ... [2023-11-26 11:46:34,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b1511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:46:34, skipping insertion in model container [2023-11-26 11:46:34,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:32" (2/3) ... [2023-11-26 11:46:34,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b1511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:46:34, skipping insertion in model container [2023-11-26 11:46:34,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:46:34" (3/3) ... [2023-11-26 11:46:34,297 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-3.i [2023-11-26 11:46:34,318 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:46:34,318 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:46:34,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:46:34,378 INFO L357 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, mHoare=true, 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;@2f746bed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:46:34,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:46:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:46:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 11:46:34,402 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:34,402 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:34,403 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:34,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash 941451293, now seen corresponding path program 1 times [2023-11-26 11:46:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:34,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003776830] [2023-11-26 11:46:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:34,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:35,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:35,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003776830] [2023-11-26 11:46:35,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003776830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:35,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:35,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:46:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669635445] [2023-11-26 11:46:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:35,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:46:35,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:35,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:46:35,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:46:35,086 INFO L87 Difference]: Start difference. First operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:46:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:35,140 INFO L93 Difference]: Finished difference Result 281 states and 444 transitions. [2023-11-26 11:46:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:46:35,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-11-26 11:46:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:35,158 INFO L225 Difference]: With dead ends: 281 [2023-11-26 11:46:35,158 INFO L226 Difference]: Without dead ends: 140 [2023-11-26 11:46:35,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:46:35,170 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:35,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:46:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-26 11:46:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-11-26 11:46:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.459016393442623) internal successors, (178), 122 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:46:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 210 transitions. [2023-11-26 11:46:35,253 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 210 transitions. Word has length 128 [2023-11-26 11:46:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:35,254 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 210 transitions. [2023-11-26 11:46:35,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:46:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 210 transitions. [2023-11-26 11:46:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 11:46:35,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:35,261 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:35,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:46:35,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:35,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash 488259973, now seen corresponding path program 1 times [2023-11-26 11:46:35,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:35,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265070314] [2023-11-26 11:46:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:35,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265070314] [2023-11-26 11:46:35,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265070314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:35,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:35,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:46:35,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500782261] [2023-11-26 11:46:35,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:35,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:46:35,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:35,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:46:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:46:35,747 INFO L87 Difference]: Start difference. First operand 140 states and 210 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:46:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:35,819 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2023-11-26 11:46:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:46:35,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-11-26 11:46:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:35,822 INFO L225 Difference]: With dead ends: 285 [2023-11-26 11:46:35,823 INFO L226 Difference]: Without dead ends: 146 [2023-11-26 11:46:35,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:35,826 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 10 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:35,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 610 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:46:35,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-26 11:46:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-11-26 11:46:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 124 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:46:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2023-11-26 11:46:35,841 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 128 [2023-11-26 11:46:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:35,843 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2023-11-26 11:46:35,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:46:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2023-11-26 11:46:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 11:46:35,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:35,846 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:35,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:46:35,847 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:35,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:35,847 INFO L85 PathProgramCache]: Analyzing trace with hash 882626759, now seen corresponding path program 1 times [2023-11-26 11:46:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588349350] [2023-11-26 11:46:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:36,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588349350] [2023-11-26 11:46:36,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588349350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:46:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132777621] [2023-11-26 11:46:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:36,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:46:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:36,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:46:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:46:36,188 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:36,243 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2023-11-26 11:46:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:46:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-11-26 11:46:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:36,246 INFO L225 Difference]: With dead ends: 321 [2023-11-26 11:46:36,246 INFO L226 Difference]: Without dead ends: 180 [2023-11-26 11:46:36,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:36,249 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 67 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:36,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 696 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:46:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-26 11:46:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2023-11-26 11:46:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:46:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2023-11-26 11:46:36,263 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 128 [2023-11-26 11:46:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:36,264 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2023-11-26 11:46:36,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2023-11-26 11:46:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-26 11:46:36,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:36,267 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:36,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:46:36,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:36,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1535191051, now seen corresponding path program 1 times [2023-11-26 11:46:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:36,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035644339] [2023-11-26 11:46:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:36,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:36,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035644339] [2023-11-26 11:46:36,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035644339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:36,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:36,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:46:36,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325786629] [2023-11-26 11:46:36,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:36,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:36,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:36,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:36,526 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:36,583 INFO L93 Difference]: Finished difference Result 363 states and 541 transitions. [2023-11-26 11:46:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:36,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-11-26 11:46:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:36,589 INFO L225 Difference]: With dead ends: 363 [2023-11-26 11:46:36,589 INFO L226 Difference]: Without dead ends: 220 [2023-11-26 11:46:36,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:36,602 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 111 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:36,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 399 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:46:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-26 11:46:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2023-11-26 11:46:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 158 states have internal predecessors, (231), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:46:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 263 transitions. [2023-11-26 11:46:36,618 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 263 transitions. Word has length 130 [2023-11-26 11:46:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:36,619 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 263 transitions. [2023-11-26 11:46:36,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 263 transitions. [2023-11-26 11:46:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-26 11:46:36,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:36,622 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:36,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:46:36,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:36,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:36,623 INFO L85 PathProgramCache]: Analyzing trace with hash -187713908, now seen corresponding path program 1 times [2023-11-26 11:46:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492231410] [2023-11-26 11:46:36,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:37,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492231410] [2023-11-26 11:46:37,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492231410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:37,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:37,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:46:37,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029321578] [2023-11-26 11:46:37,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:37,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:46:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:37,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:46:37,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:37,128 INFO L87 Difference]: Start difference. First operand 176 states and 263 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:37,258 INFO L93 Difference]: Finished difference Result 526 states and 787 transitions. [2023-11-26 11:46:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:46:37,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-11-26 11:46:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:37,263 INFO L225 Difference]: With dead ends: 526 [2023-11-26 11:46:37,263 INFO L226 Difference]: Without dead ends: 351 [2023-11-26 11:46:37,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:37,264 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 348 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:37,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 801 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:46:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-11-26 11:46:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2023-11-26 11:46:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 308 states have (on average 1.4545454545454546) internal successors, (448), 308 states have internal predecessors, (448), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 11:46:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 512 transitions. [2023-11-26 11:46:37,309 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 512 transitions. Word has length 130 [2023-11-26 11:46:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:37,312 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 512 transitions. [2023-11-26 11:46:37,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 512 transitions. [2023-11-26 11:46:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-26 11:46:37,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:37,318 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:37,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:46:37,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:37,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash -239013210, now seen corresponding path program 1 times [2023-11-26 11:46:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822108873] [2023-11-26 11:46:37,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822108873] [2023-11-26 11:46:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822108873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:38,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:38,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:46:38,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838690224] [2023-11-26 11:46:38,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:38,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:46:38,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:46:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:38,052 INFO L87 Difference]: Start difference. First operand 343 states and 512 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:38,275 INFO L93 Difference]: Finished difference Result 658 states and 981 transitions. [2023-11-26 11:46:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:46:38,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-26 11:46:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:38,280 INFO L225 Difference]: With dead ends: 658 [2023-11-26 11:46:38,280 INFO L226 Difference]: Without dead ends: 483 [2023-11-26 11:46:38,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:46:38,284 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 247 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:38,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1287 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:46:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-11-26 11:46:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 450. [2023-11-26 11:46:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 411 states have internal predecessors, (598), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:46:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2023-11-26 11:46:38,326 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 131 [2023-11-26 11:46:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:38,327 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2023-11-26 11:46:38,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2023-11-26 11:46:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-26 11:46:38,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:38,331 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:38,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:46:38,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:38,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:38,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2080596326, now seen corresponding path program 1 times [2023-11-26 11:46:38,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:38,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726086824] [2023-11-26 11:46:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:38,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:38,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726086824] [2023-11-26 11:46:38,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726086824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:38,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:46:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921883111] [2023-11-26 11:46:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:38,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:46:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:38,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:46:38,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:38,899 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:39,143 INFO L93 Difference]: Finished difference Result 939 states and 1399 transitions. [2023-11-26 11:46:39,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:46:39,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-11-26 11:46:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:39,152 INFO L225 Difference]: With dead ends: 939 [2023-11-26 11:46:39,153 INFO L226 Difference]: Without dead ends: 490 [2023-11-26 11:46:39,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:46:39,155 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 390 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:39,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1046 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:46:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-11-26 11:46:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 450. [2023-11-26 11:46:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 410 states have (on average 1.4560975609756097) internal successors, (597), 411 states have internal predecessors, (597), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:46:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 669 transitions. [2023-11-26 11:46:39,183 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 669 transitions. Word has length 132 [2023-11-26 11:46:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:39,183 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 669 transitions. [2023-11-26 11:46:39,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 669 transitions. [2023-11-26 11:46:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-26 11:46:39,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:39,187 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:39,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:46:39,188 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:39,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash 250262094, now seen corresponding path program 1 times [2023-11-26 11:46:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203982441] [2023-11-26 11:46:39,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:39,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:39,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:39,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203982441] [2023-11-26 11:46:39,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203982441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:39,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:39,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:46:39,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644730215] [2023-11-26 11:46:39,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:39,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:46:39,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:46:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:39,519 INFO L87 Difference]: Start difference. First operand 450 states and 669 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:39,614 INFO L93 Difference]: Finished difference Result 1130 states and 1683 transitions. [2023-11-26 11:46:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:46:39,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-11-26 11:46:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:39,620 INFO L225 Difference]: With dead ends: 1130 [2023-11-26 11:46:39,620 INFO L226 Difference]: Without dead ends: 681 [2023-11-26 11:46:39,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:46:39,623 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 124 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:39,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 900 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:46:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-26 11:46:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 453. [2023-11-26 11:46:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 413 states have (on average 1.4527845036319613) internal successors, (600), 414 states have internal predecessors, (600), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:46:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 672 transitions. [2023-11-26 11:46:39,662 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 672 transitions. Word has length 132 [2023-11-26 11:46:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:39,663 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 672 transitions. [2023-11-26 11:46:39,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 672 transitions. [2023-11-26 11:46:39,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-26 11:46:39,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:39,666 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:39,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:46:39,666 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:39,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:39,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1364529179, now seen corresponding path program 1 times [2023-11-26 11:46:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:39,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838674841] [2023-11-26 11:46:39,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:39,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:40,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838674841] [2023-11-26 11:46:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838674841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:40,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:46:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696333569] [2023-11-26 11:46:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:40,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:46:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:46:40,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:40,020 INFO L87 Difference]: Start difference. First operand 453 states and 672 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:40,088 INFO L93 Difference]: Finished difference Result 980 states and 1457 transitions. [2023-11-26 11:46:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:46:40,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-26 11:46:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:40,093 INFO L225 Difference]: With dead ends: 980 [2023-11-26 11:46:40,093 INFO L226 Difference]: Without dead ends: 528 [2023-11-26 11:46:40,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:46:40,095 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 144 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 765 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.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:40,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 765 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:46:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-11-26 11:46:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 462. [2023-11-26 11:46:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 422 states have (on average 1.4431279620853081) internal successors, (609), 423 states have internal predecessors, (609), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:46:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 681 transitions. [2023-11-26 11:46:40,118 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 681 transitions. Word has length 133 [2023-11-26 11:46:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:40,119 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 681 transitions. [2023-11-26 11:46:40,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:40,119 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 681 transitions. [2023-11-26 11:46:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-26 11:46:40,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:40,121 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:40,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:46:40,122 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:40,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -398224276, now seen corresponding path program 1 times [2023-11-26 11:46:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391329109] [2023-11-26 11:46:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:40,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:40,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391329109] [2023-11-26 11:46:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391329109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:40,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:40,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:46:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549441252] [2023-11-26 11:46:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:40,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:46:40,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:40,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:46:40,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:40,822 INFO L87 Difference]: Start difference. First operand 462 states and 681 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:41,181 INFO L93 Difference]: Finished difference Result 853 states and 1258 transitions. [2023-11-26 11:46:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:46:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-26 11:46:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:41,186 INFO L225 Difference]: With dead ends: 853 [2023-11-26 11:46:41,186 INFO L226 Difference]: Without dead ends: 563 [2023-11-26 11:46:41,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:46:41,188 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 494 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:41,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1039 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:46:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2023-11-26 11:46:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 522. [2023-11-26 11:46:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 469 states have (on average 1.4307036247334755) internal successors, (671), 469 states have internal predecessors, (671), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-26 11:46:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 767 transitions. [2023-11-26 11:46:41,239 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 767 transitions. Word has length 133 [2023-11-26 11:46:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:41,240 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 767 transitions. [2023-11-26 11:46:41,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 767 transitions. [2023-11-26 11:46:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-26 11:46:41,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:41,244 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:41,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:46:41,245 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:41,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash 26607360, now seen corresponding path program 1 times [2023-11-26 11:46:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:41,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268203911] [2023-11-26 11:46:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268203911] [2023-11-26 11:46:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268203911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:41,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:46:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748959755] [2023-11-26 11:46:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:41,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:46:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:46:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:41,846 INFO L87 Difference]: Start difference. First operand 522 states and 767 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:42,163 INFO L93 Difference]: Finished difference Result 954 states and 1402 transitions. [2023-11-26 11:46:42,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:46:42,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-26 11:46:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:42,168 INFO L225 Difference]: With dead ends: 954 [2023-11-26 11:46:42,168 INFO L226 Difference]: Without dead ends: 604 [2023-11-26 11:46:42,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:46:42,170 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 574 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:42,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 978 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:46:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2023-11-26 11:46:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 355. [2023-11-26 11:46:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 319 states have (on average 1.4231974921630095) internal successors, (454), 319 states have internal predecessors, (454), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 11:46:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 518 transitions. [2023-11-26 11:46:42,197 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 518 transitions. Word has length 133 [2023-11-26 11:46:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:42,198 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 518 transitions. [2023-11-26 11:46:42,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 518 transitions. [2023-11-26 11:46:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:46:42,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:42,201 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:42,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:46:42,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:42,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash -341486804, now seen corresponding path program 1 times [2023-11-26 11:46:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:42,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077115451] [2023-11-26 11:46:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:42,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:42,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077115451] [2023-11-26 11:46:42,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077115451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:42,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:42,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 11:46:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78749435] [2023-11-26 11:46:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:42,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:46:42,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:46:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:46:42,969 INFO L87 Difference]: Start difference. First operand 355 states and 518 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:43,484 INFO L93 Difference]: Finished difference Result 894 states and 1303 transitions. [2023-11-26 11:46:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 11:46:43,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-11-26 11:46:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:43,489 INFO L225 Difference]: With dead ends: 894 [2023-11-26 11:46:43,490 INFO L226 Difference]: Without dead ends: 540 [2023-11-26 11:46:43,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-11-26 11:46:43,492 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 403 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:43,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 2632 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:46:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-11-26 11:46:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 469. [2023-11-26 11:46:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 428 states have (on average 1.425233644859813) internal successors, (610), 429 states have internal predecessors, (610), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:46:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 682 transitions. [2023-11-26 11:46:43,521 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 682 transitions. Word has length 134 [2023-11-26 11:46:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:43,522 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 682 transitions. [2023-11-26 11:46:43,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 682 transitions. [2023-11-26 11:46:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:46:43,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:43,525 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:43,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:46:43,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:43,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash -734513814, now seen corresponding path program 1 times [2023-11-26 11:46:43,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:43,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600722141] [2023-11-26 11:46:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:43,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:43,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600722141] [2023-11-26 11:46:43,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600722141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:43,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:43,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:46:43,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356771678] [2023-11-26 11:46:43,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:43,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:46:43,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:46:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:43,783 INFO L87 Difference]: Start difference. First operand 469 states and 682 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:43,935 INFO L93 Difference]: Finished difference Result 1028 states and 1493 transitions. [2023-11-26 11:46:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:46:43,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-11-26 11:46:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:43,940 INFO L225 Difference]: With dead ends: 1028 [2023-11-26 11:46:43,940 INFO L226 Difference]: Without dead ends: 560 [2023-11-26 11:46:43,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:46:43,943 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 200 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:43,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1250 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:46:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-11-26 11:46:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 487. [2023-11-26 11:46:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 437 states have (on average 1.414187643020595) internal successors, (618), 439 states have internal predecessors, (618), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-26 11:46:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 706 transitions. [2023-11-26 11:46:43,978 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 706 transitions. Word has length 134 [2023-11-26 11:46:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:43,979 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 706 transitions. [2023-11-26 11:46:43,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 706 transitions. [2023-11-26 11:46:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:46:43,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:43,983 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:43,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:46:43,983 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:43,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2030430546, now seen corresponding path program 1 times [2023-11-26 11:46:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:43,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873742392] [2023-11-26 11:46:43,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:44,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:44,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873742392] [2023-11-26 11:46:44,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873742392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:44,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:44,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:46:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393169230] [2023-11-26 11:46:44,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:44,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:46:44,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:44,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:46:44,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:44,224 INFO L87 Difference]: Start difference. First operand 487 states and 706 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:44,368 INFO L93 Difference]: Finished difference Result 1007 states and 1456 transitions. [2023-11-26 11:46:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:46:44,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-11-26 11:46:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:44,373 INFO L225 Difference]: With dead ends: 1007 [2023-11-26 11:46:44,373 INFO L226 Difference]: Without dead ends: 529 [2023-11-26 11:46:44,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:46:44,377 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 225 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:44,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1131 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:46:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-11-26 11:46:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 471. [2023-11-26 11:46:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 429 states have (on average 1.4195804195804196) internal successors, (609), 430 states have internal predecessors, (609), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:46:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 681 transitions. [2023-11-26 11:46:44,410 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 681 transitions. Word has length 134 [2023-11-26 11:46:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:44,411 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 681 transitions. [2023-11-26 11:46:44,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 681 transitions. [2023-11-26 11:46:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:46:44,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:44,415 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:44,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:46:44,416 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:44,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1871509740, now seen corresponding path program 1 times [2023-11-26 11:46:44,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:44,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516189049] [2023-11-26 11:46:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:44,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:45,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516189049] [2023-11-26 11:46:45,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516189049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:45,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 11:46:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276645061] [2023-11-26 11:46:45,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:45,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:46:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:45,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:46:45,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:46:45,161 INFO L87 Difference]: Start difference. First operand 471 states and 681 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:45,629 INFO L93 Difference]: Finished difference Result 991 states and 1430 transitions. [2023-11-26 11:46:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:46:45,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-11-26 11:46:45,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:45,633 INFO L225 Difference]: With dead ends: 991 [2023-11-26 11:46:45,634 INFO L226 Difference]: Without dead ends: 521 [2023-11-26 11:46:45,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-11-26 11:46:45,636 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 331 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:45,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 2690 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:46:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2023-11-26 11:46:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 432. [2023-11-26 11:46:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 390 states have (on average 1.4153846153846155) internal successors, (552), 391 states have internal predecessors, (552), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:46:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 624 transitions. [2023-11-26 11:46:45,666 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 624 transitions. Word has length 134 [2023-11-26 11:46:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:45,666 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 624 transitions. [2023-11-26 11:46:45,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 624 transitions. [2023-11-26 11:46:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:46:45,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:45,669 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:45,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:46:45,670 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:45,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash -675021143, now seen corresponding path program 1 times [2023-11-26 11:46:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:45,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337500702] [2023-11-26 11:46:45,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337500702] [2023-11-26 11:46:45,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337500702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:45,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:45,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:46:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13148182] [2023-11-26 11:46:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:45,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:45,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:45,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:45,834 INFO L87 Difference]: Start difference. First operand 432 states and 624 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:45,890 INFO L93 Difference]: Finished difference Result 924 states and 1327 transitions. [2023-11-26 11:46:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:45,891 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-11-26 11:46:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:45,894 INFO L225 Difference]: With dead ends: 924 [2023-11-26 11:46:45,895 INFO L226 Difference]: Without dead ends: 501 [2023-11-26 11:46:45,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:45,897 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 102 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:45,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 489 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:46:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-11-26 11:46:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 409. [2023-11-26 11:46:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 367 states have (on average 1.3923705722070845) internal successors, (511), 368 states have internal predecessors, (511), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:46:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 583 transitions. [2023-11-26 11:46:45,928 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 583 transitions. Word has length 134 [2023-11-26 11:46:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:45,929 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 583 transitions. [2023-11-26 11:46:45,929 INFO L496 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 583 transitions. [2023-11-26 11:46:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-26 11:46:45,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:45,932 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:45,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:46:45,933 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:45,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1387420490, now seen corresponding path program 1 times [2023-11-26 11:46:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484016576] [2023-11-26 11:46:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:46,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:46,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484016576] [2023-11-26 11:46:46,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484016576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:46,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:46,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:46:46,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049163796] [2023-11-26 11:46:46,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:46,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:46:46,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:46,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:46:46,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:46:46,973 INFO L87 Difference]: Start difference. First operand 409 states and 583 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:47,653 INFO L93 Difference]: Finished difference Result 1217 states and 1744 transitions. [2023-11-26 11:46:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-26 11:46:47,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-11-26 11:46:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:47,659 INFO L225 Difference]: With dead ends: 1217 [2023-11-26 11:46:47,660 INFO L226 Difference]: Without dead ends: 817 [2023-11-26 11:46:47,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2023-11-26 11:46:47,662 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 770 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:47,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1613 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:46:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2023-11-26 11:46:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 673. [2023-11-26 11:46:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 624 states have (on average 1.4070512820512822) internal successors, (878), 627 states have internal predecessors, (878), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-26 11:46:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 958 transitions. [2023-11-26 11:46:47,705 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 958 transitions. Word has length 135 [2023-11-26 11:46:47,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:47,706 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 958 transitions. [2023-11-26 11:46:47,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:47,706 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 958 transitions. [2023-11-26 11:46:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-26 11:46:47,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:47,709 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:47,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:46:47,710 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:47,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1083401524, now seen corresponding path program 1 times [2023-11-26 11:46:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:47,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058314959] [2023-11-26 11:46:47,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:47,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058314959] [2023-11-26 11:46:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058314959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:47,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:47,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:46:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419804328] [2023-11-26 11:46:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:47,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:46:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:47,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:46:47,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:47,969 INFO L87 Difference]: Start difference. First operand 673 states and 958 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:48,123 INFO L93 Difference]: Finished difference Result 1637 states and 2341 transitions. [2023-11-26 11:46:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:46:48,124 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-11-26 11:46:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:48,133 INFO L225 Difference]: With dead ends: 1637 [2023-11-26 11:46:48,133 INFO L226 Difference]: Without dead ends: 977 [2023-11-26 11:46:48,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:48,136 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 198 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:48,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 823 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:46:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2023-11-26 11:46:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 843. [2023-11-26 11:46:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 794 states have (on average 1.4105793450881612) internal successors, (1120), 797 states have internal predecessors, (1120), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-26 11:46:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1200 transitions. [2023-11-26 11:46:48,190 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1200 transitions. Word has length 135 [2023-11-26 11:46:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:48,192 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1200 transitions. [2023-11-26 11:46:48,192 INFO L496 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1200 transitions. [2023-11-26 11:46:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-26 11:46:48,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:48,197 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:48,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:46:48,197 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:48,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash -7179097, now seen corresponding path program 1 times [2023-11-26 11:46:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:48,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493914319] [2023-11-26 11:46:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-26 11:46:49,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493914319] [2023-11-26 11:46:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493914319] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:46:49,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688849774] [2023-11-26 11:46:49,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:49,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:46:49,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:46:49,214 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:46:49,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:46:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:49,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-26 11:46:49,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:46:49,943 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 [2023-11-26 11:46:51,155 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 88 treesize of output 68 [2023-11-26 11:46:51,166 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 38 treesize of output 26 [2023-11-26 11:46:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-11-26 11:46:51,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:46:52,140 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 35 treesize of output 27 [2023-11-26 11:46:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-26 11:46:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688849774] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:46:52,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:46:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 33 [2023-11-26 11:46:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823920178] [2023-11-26 11:46:52,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:46:52,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-26 11:46:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-26 11:46:52,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2023-11-26 11:46:52,277 INFO L87 Difference]: Start difference. First operand 843 states and 1200 transitions. Second operand has 33 states, 30 states have (on average 5.766666666666667) internal successors, (173), 32 states have internal predecessors, (173), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) [2023-11-26 11:46:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:56,283 INFO L93 Difference]: Finished difference Result 2098 states and 2946 transitions. [2023-11-26 11:46:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-26 11:46:56,284 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.766666666666667) internal successors, (173), 32 states have internal predecessors, (173), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) Word has length 137 [2023-11-26 11:46:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:56,291 INFO L225 Difference]: With dead ends: 2098 [2023-11-26 11:46:56,291 INFO L226 Difference]: Without dead ends: 1268 [2023-11-26 11:46:56,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1605, Invalid=7707, Unknown=0, NotChecked=0, Total=9312 [2023-11-26 11:46:56,297 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 2992 mSDsluCounter, 4894 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 5199 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:56,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2993 Valid, 5199 Invalid, 1610 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [297 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-26 11:46:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2023-11-26 11:46:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 943. [2023-11-26 11:46:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 883 states have (on average 1.3975084937712345) internal successors, (1234), 883 states have internal predecessors, (1234), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-26 11:46:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1330 transitions. [2023-11-26 11:46:56,366 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1330 transitions. Word has length 137 [2023-11-26 11:46:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:56,367 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1330 transitions. [2023-11-26 11:46:56,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.766666666666667) internal successors, (173), 32 states have internal predecessors, (173), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) [2023-11-26 11:46:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1330 transitions. [2023-11-26 11:46:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-26 11:46:56,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:56,370 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:56,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:46:56,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:46:56,578 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:56,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash 172240624, now seen corresponding path program 1 times [2023-11-26 11:46:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:56,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144934833] [2023-11-26 11:46:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:56,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144934833] [2023-11-26 11:46:56,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144934833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:56,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:46:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996366145] [2023-11-26 11:46:56,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:56,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:46:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:46:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:56,902 INFO L87 Difference]: Start difference. First operand 943 states and 1330 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:57,151 INFO L93 Difference]: Finished difference Result 1871 states and 2635 transitions. [2023-11-26 11:46:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:46:57,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-11-26 11:46:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:57,159 INFO L225 Difference]: With dead ends: 1871 [2023-11-26 11:46:57,159 INFO L226 Difference]: Without dead ends: 1168 [2023-11-26 11:46:57,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:46:57,163 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 247 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:57,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 963 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:46:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2023-11-26 11:46:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1003. [2023-11-26 11:46:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 932 states have (on average 1.3927038626609443) internal successors, (1298), 933 states have internal predecessors, (1298), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-26 11:46:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1410 transitions. [2023-11-26 11:46:57,248 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1410 transitions. Word has length 137 [2023-11-26 11:46:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:57,248 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1410 transitions. [2023-11-26 11:46:57,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1410 transitions. [2023-11-26 11:46:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-26 11:46:57,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:57,251 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:57,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 11:46:57,252 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:57,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:57,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1700942396, now seen corresponding path program 1 times [2023-11-26 11:46:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:57,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360732091] [2023-11-26 11:46:57,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:46:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:46:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:46:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:46:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:46:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:46:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:46:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:46:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:46:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:46:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:46:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:46:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:46:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:46:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:46:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:46:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:46:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:57,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360732091] [2023-11-26 11:46:57,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360732091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:57,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:57,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:46:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313688214] [2023-11-26 11:46:57,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:57,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:46:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:57,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:46:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:57,549 INFO L87 Difference]: Start difference. First operand 1003 states and 1410 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:46:57,728 INFO L93 Difference]: Finished difference Result 2082 states and 2920 transitions. [2023-11-26 11:46:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:46:57,729 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-11-26 11:46:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:46:57,736 INFO L225 Difference]: With dead ends: 2082 [2023-11-26 11:46:57,736 INFO L226 Difference]: Without dead ends: 1080 [2023-11-26 11:46:57,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:57,739 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 133 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:46:57,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 740 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:46:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2023-11-26 11:46:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 990. [2023-11-26 11:46:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 919 states have (on average 1.3895538628944506) internal successors, (1277), 920 states have internal predecessors, (1277), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-26 11:46:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1389 transitions. [2023-11-26 11:46:57,805 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1389 transitions. Word has length 138 [2023-11-26 11:46:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:46:57,805 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1389 transitions. [2023-11-26 11:46:57,805 INFO L496 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:46:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1389 transitions. [2023-11-26 11:46:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-26 11:46:57,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:46:57,808 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:57,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 11:46:57,808 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:46:57,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2004961362, now seen corresponding path program 1 times [2023-11-26 11:46:57,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:57,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311467924] [2023-11-26 11:46:57,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:57,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:46:57,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:46:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:46:58,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:46:58,058 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:46:58,059 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:46:58,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 11:46:58,066 INFO L445 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] [2023-11-26 11:46:58,071 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:46:58,245 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-26 11:46:58,257 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-11-26 11:46:58,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated [2023-11-26 11:46:58,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-11-26 11:46:58,266 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated [2023-11-26 11:46:58,270 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-26 11:46:58,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated [2023-11-26 11:46:58,277 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-26 11:46:58,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-26 11:46:58,280 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-26 11:46:58,282 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-11-26 11:46:58,283 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-26 11:46:58,284 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated [2023-11-26 11:46:58,285 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated [2023-11-26 11:46:58,286 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated [2023-11-26 11:46:58,286 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-26 11:46:58,286 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short80 could not be translated [2023-11-26 11:46:58,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated [2023-11-26 11:46:58,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated [2023-11-26 11:46:58,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-26 11:46:58,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated [2023-11-26 11:46:58,293 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated [2023-11-26 11:46:58,293 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short80 could not be translated [2023-11-26 11:46:58,293 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:46:58,295 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:46:58,295 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:46:58,295 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short92 could not be translated [2023-11-26 11:46:58,296 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:46:58,296 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:46:58,296 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short88 could not be translated [2023-11-26 11:46:58,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-26 11:46:58,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short88 could not be translated [2023-11-26 11:46:58,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-26 11:46:58,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short92 could not be translated [2023-11-26 11:46:58,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-26 11:46:58,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-26 11:46:58,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-26 11:46:58,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-26 11:46:58,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-26 11:46:58,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-26 11:46:58,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short100 could not be translated [2023-11-26 11:46:58,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-26 11:46:58,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short100 could not be translated [2023-11-26 11:46:58,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-26 11:46:58,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-26 11:46:58,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated [2023-11-26 11:46:58,305 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated [2023-11-26 11:46:58,305 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem103 could not be translated [2023-11-26 11:46:58,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated [2023-11-26 11:46:58,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-26 11:46:58,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem103 could not be translated [2023-11-26 11:46:58,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short104 could not be translated [2023-11-26 11:46:58,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short104 could not be translated [2023-11-26 11:46:58,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem103 could not be translated [2023-11-26 11:46:58,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-26 11:46:58,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated [2023-11-26 11:46:58,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated [2023-11-26 11:46:58,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-26 11:46:58,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite21 could not be translated [2023-11-26 11:46:58,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-26 11:46:58,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-26 11:46:58,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-26 11:46:58,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-26 11:46:58,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated [2023-11-26 11:46:58,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-26 11:46:58,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-26 11:46:58,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated [2023-11-26 11:46:58,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-26 11:46:58,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated [2023-11-26 11:46:58,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-26 11:46:58,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-26 11:46:58,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-26 11:46:58,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated [2023-11-26 11:46:58,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated [2023-11-26 11:46:58,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-26 11:46:58,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-26 11:46:58,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-26 11:46:58,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-26 11:46:58,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-26 11:46:58,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-26 11:46:58,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated [2023-11-26 11:46:58,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated [2023-11-26 11:46:58,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-26 11:46:58,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-26 11:46:58,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-26 11:46:58,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-26 11:46:58,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-26 11:46:58,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-26 11:46:58,323 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated [2023-11-26 11:46:58,323 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated [2023-11-26 11:46:58,324 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-26 11:46:58,324 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated [2023-11-26 11:46:58,324 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,324 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-26 11:46:58,324 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-26 11:46:58,325 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-26 11:46:58,325 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,325 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated [2023-11-26 11:46:58,325 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-26 11:46:58,325 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-26 11:46:58,325 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated [2023-11-26 11:46:58,326 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated [2023-11-26 11:46:58,326 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated [2023-11-26 11:46:58,326 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-26 11:46:58,326 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-26 11:46:58,327 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated [2023-11-26 11:46:58,327 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated [2023-11-26 11:46:58,327 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated [2023-11-26 11:46:58,327 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated [2023-11-26 11:46:58,327 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-26 11:46:58,327 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-26 11:46:58,328 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,328 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-26 11:46:58,328 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,328 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated [2023-11-26 11:46:58,328 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-26 11:46:58,329 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated [2023-11-26 11:46:58,329 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,330 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated [2023-11-26 11:46:58,330 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-26 11:46:58,330 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-26 11:46:58,330 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated [2023-11-26 11:46:58,330 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-26 11:46:58,331 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-26 11:46:58,331 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated [2023-11-26 11:46:58,331 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated [2023-11-26 11:46:58,331 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated [2023-11-26 11:46:58,331 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-26 11:46:58,331 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,332 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-26 11:46:58,332 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated [2023-11-26 11:46:58,332 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short180 could not be translated [2023-11-26 11:46:58,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated [2023-11-26 11:46:58,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem177 could not be translated [2023-11-26 11:46:58,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem142 could not be translated [2023-11-26 11:46:58,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated [2023-11-26 11:46:58,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-26 11:46:58,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-26 11:46:58,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite179 could not be translated [2023-11-26 11:46:58,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem178 could not be translated [2023-11-26 11:46:58,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-26 11:46:58,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated [2023-11-26 11:46:58,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated [2023-11-26 11:46:58,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-26 11:46:58,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated [2023-11-26 11:46:58,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-26 11:46:58,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short180 could not be translated [2023-11-26 11:46:58,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated [2023-11-26 11:46:58,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-26 11:46:58,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated [2023-11-26 11:46:58,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem142 could not be translated [2023-11-26 11:46:58,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated [2023-11-26 11:46:58,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-26 11:46:58,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated [2023-11-26 11:46:58,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem178 could not be translated [2023-11-26 11:46:58,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite179 could not be translated [2023-11-26 11:46:58,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-26 11:46:58,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated [2023-11-26 11:46:58,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem177 could not be translated [2023-11-26 11:46:58,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated [2023-11-26 11:46:58,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-26 11:46:58,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-26 11:46:58,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated [2023-11-26 11:46:58,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-26 11:46:58,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated [2023-11-26 11:46:58,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short180 could not be translated [2023-11-26 11:46:58,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-26 11:46:58,340 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-26 11:46:58,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:46:58 BoogieIcfgContainer [2023-11-26 11:46:58,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:46:58,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:46:58,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:46:58,386 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:46:58,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:46:34" (3/4) ... [2023-11-26 11:46:58,389 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:46:58,390 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:46:58,391 INFO L158 Benchmark]: Toolchain (without parser) took 26003.98ms. Allocated memory was 138.4MB in the beginning and 488.6MB in the end (delta: 350.2MB). Free memory was 109.0MB in the beginning and 419.8MB in the end (delta: -310.8MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,394 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:46:58,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.82ms. Allocated memory is still 138.4MB. Free memory was 108.9MB in the beginning and 94.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.65ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 90.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,400 INFO L158 Benchmark]: Boogie Preprocessor took 144.75ms. Allocated memory is still 138.4MB. Free memory was 90.2MB in the beginning and 84.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,401 INFO L158 Benchmark]: RCFGBuilder took 1307.19ms. Allocated memory is still 138.4MB. Free memory was 84.4MB in the beginning and 83.0MB in the end (delta: 1.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,401 INFO L158 Benchmark]: TraceAbstraction took 24095.64ms. Allocated memory was 138.4MB in the beginning and 488.6MB in the end (delta: 350.2MB). Free memory was 82.3MB in the beginning and 419.8MB in the end (delta: -337.4MB). Peak memory consumption was 279.3MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,403 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 488.6MB. Free memory is still 419.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:46:58,408 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.30ms. Allocated memory is still 111.1MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.82ms. Allocated memory is still 138.4MB. Free memory was 108.9MB in the beginning and 94.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.65ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 90.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.75ms. Allocated memory is still 138.4MB. Free memory was 90.2MB in the beginning and 84.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1307.19ms. Allocated memory is still 138.4MB. Free memory was 84.4MB in the beginning and 83.0MB in the end (delta: 1.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24095.64ms. Allocated memory was 138.4MB in the beginning and 488.6MB in the end (delta: 350.2MB). Free memory was 82.3MB in the beginning and 419.8MB in the end (delta: -337.4MB). Peak memory consumption was 279.3MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 488.6MB. Free memory is still 419.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short100 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short100 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem103 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem103 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short104 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short104 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem103 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short180 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem177 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem142 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite179 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem178 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short180 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem142 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem178 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite179 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem177 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short180 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 112, overapproximation of someUnaryDOUBLEoperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] signed long int var_1_6 = -64; [L28] signed long int var_1_6 = -64; [L29] signed long int* var_1_6_Pointer = &(var_1_6); [L30] signed long int var_1_7 = -5; [L30] signed long int var_1_7 = -5; [L31] signed long int* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = 500; [L32] signed long int var_1_8 = 500; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] signed long int var_1_9 = -5; [L34] signed long int var_1_9 = -5; [L35] signed long int* var_1_9_Pointer = &(var_1_9); [L36] signed long int var_1_10 = -100; [L36] signed long int var_1_10 = -100; [L37] signed long int* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_11 = 1; [L38] unsigned char var_1_11 = 1; [L39] unsigned char* var_1_11_Pointer = &(var_1_11); [L40] double var_1_12 = 127.5; [L40] double var_1_12 = 127.5; [L41] double* var_1_12_Pointer = &(var_1_12); [L42] double var_1_13 = 15.75; [L42] double var_1_13 = 15.75; [L43] double* var_1_13_Pointer = &(var_1_13); [L44] double var_1_14 = -0.5; [L44] double var_1_14 = -0.5; [L45] double* var_1_14_Pointer = &(var_1_14); [L46] double var_1_15 = 5.25; [L46] double var_1_15 = 5.25; [L47] double* var_1_15_Pointer = &(var_1_15); [L48] double var_1_16 = 8.5; [L48] double var_1_16 = 8.5; [L49] double* var_1_16_Pointer = &(var_1_16); [L50] unsigned char last_1_var_1_11 = 1; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR \read(var_1_11) [L109] last_1_var_1_11 = var_1_11 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] var_1_7 = __VERIFIER_nondet_long() [L88] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] var_1_8 = __VERIFIER_nondet_long() [L91] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] var_1_9 = __VERIFIER_nondet_long() [L94] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] var_1_10 = __VERIFIER_nondet_long() [L97] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] var_1_13 = __VERIFIER_nondet_double() [L100] EXPR \read(var_1_13) [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F [L100] EXPR \read(var_1_13) [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] var_1_14 = __VERIFIER_nondet_double() [L102] EXPR \read(var_1_14) [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F [L102] EXPR \read(var_1_14) [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] var_1_15 = __VERIFIER_nondet_double() [L104] EXPR \read(var_1_15) [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F [L104] EXPR \read(var_1_15) [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] var_1_16 = __VERIFIER_nondet_double() [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] RET updateVariables() [L121] CALL step() [L54] unsigned char stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND FALSE !(! last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L60] EXPR \read(*var_1_7_Pointer) [L60] signed long int stepLocal_2 = (*(var_1_7_Pointer)); [L61] EXPR \read(*var_1_10_Pointer) [L61] signed long int stepLocal_1 = (*(var_1_10_Pointer)); [L62] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND FALSE !((*(var_1_8_Pointer)) <= stepLocal_2) [L69] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L69] COND FALSE !(! (*(var_1_11_Pointer))) [L72] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) [L72] EXPR \read(*var_1_9_Pointer) [L72] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=18, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR \read(*var_1_10_Pointer) [L72] EXPR \read(*var_1_7_Pointer) [L72] (*(var_1_6_Pointer)) = (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))) [L74] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] COND FALSE !((*(var_1_4_Pointer))) [L77] EXPR \read(*var_1_15_Pointer) [L77] (*(var_1_12_Pointer)) = (*(var_1_15_Pointer)) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR (! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1 [L112] EXPR (! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) [L112] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))) [L112] EXPR \read(*var_1_6_Pointer) [L112] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) [L112] EXPR \read(*var_1_9_Pointer) [L112] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR \read(*var_1_10_Pointer) [L112] EXPR \read(*var_1_7_Pointer) [L112] EXPR (! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) [L112] EXPR \read(*var_1_8_Pointer) [L112] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1 [L112] EXPR ((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) [L112] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer)))) [L112] EXPR \read(*var_1_12_Pointer) [L112] EXPR \read(*var_1_15_Pointer) [L112] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer)))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112-L113] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.7s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8112 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8110 mSDsluCounter, 26257 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20511 mSDsCounter, 406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3051 IncrementalHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 406 mSolverCounterUnsat, 5746 mSDtfsCounter, 3051 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 988 SyntacticMatches, 1 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1003occurred in iteration=20, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 1990 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 3065 NumberOfCodeBlocks, 3065 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3041 ConstructedInterpolants, 0 QuantifiedInterpolants, 9719 SizeOfPredicates, 25 NumberOfNonLiveVariables, 616 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 10776/11040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 11:46:58,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme --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 ce7290e6713376455badf7100d5aceeca845cede6d066d71203baae97fa0e235 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:47:01,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:47:01,295 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:47:01,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:47:01,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:47:01,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:47:01,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:47:01,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:47:01,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:47:01,359 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:47:01,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:47:01,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:47:01,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:47:01,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:47:01,364 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:47:01,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:47:01,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:47:01,366 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:47:01,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:47:01,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:47:01,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:47:01,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:47:01,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:47:01,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:47:01,370 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:47:01,371 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:47:01,371 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:47:01,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:47:01,372 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:47:01,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:47:01,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:47:01,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:47:01,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:47:01,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:01,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:47:01,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:47:01,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:47:01,377 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:47:01,378 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:47:01,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:47:01,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:47:01,379 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:47:01,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:47:01,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:47:01,380 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:47:01,380 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme 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 -> ce7290e6713376455badf7100d5aceeca845cede6d066d71203baae97fa0e235 [2023-11-26 11:47:01,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:47:01,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:47:01,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:47:01,837 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:47:01,838 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:47:01,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i [2023-11-26 11:47:05,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:47:05,369 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:47:05,370 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i [2023-11-26 11:47:05,383 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/data/21043e259/ab20e8ac4bed4aebbe641b814c14172b/FLAG29c163ad6 [2023-11-26 11:47:05,404 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/data/21043e259/ab20e8ac4bed4aebbe641b814c14172b [2023-11-26 11:47:05,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:47:05,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:47:05,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:05,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:47:05,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:47:05,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:05,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163b6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05, skipping insertion in model container [2023-11-26 11:47:05,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:05,467 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:47:05,649 WARN L240 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_ae00df1b-734d-4c67-b8e6-18a0c0924db9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i[915,928] [2023-11-26 11:47:05,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:05,750 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:47:05,764 WARN L240 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_ae00df1b-734d-4c67-b8e6-18a0c0924db9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i[915,928] [2023-11-26 11:47:05,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:05,826 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:47:05,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05 WrapperNode [2023-11-26 11:47:05,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:05,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:05,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:47:05,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:47:05,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:05,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:05,924 INFO L138 Inliner]: procedures = 33, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 590 [2023-11-26 11:47:05,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:05,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:47:05,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:47:05,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:47:05,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:05,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:05,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:06,008 INFO L175 MemorySlicer]: Split 151 memory accesses to 15 slices as follows [2, 5, 8, 10, 5, 10, 8, 12, 8, 8, 5, 14, 14, 12, 30]. 20 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1]. [2023-11-26 11:47:06,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:06,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:06,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:06,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:06,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:06,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:06,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:47:06,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:47:06,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:47:06,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:47:06,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (1/1) ... [2023-11-26 11:47:06,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:06,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:06,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:47:06,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:47:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:47:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-26 11:47:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-26 11:47:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-11-26 11:47:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-11-26 11:47:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-11-26 11:47:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2023-11-26 11:47:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2023-11-26 11:47:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2023-11-26 11:47:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2023-11-26 11:47:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2023-11-26 11:47:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2023-11-26 11:47:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2023-11-26 11:47:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2023-11-26 11:47:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2023-11-26 11:47:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2023-11-26 11:47:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-26 11:47:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-26 11:47:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-11-26 11:47:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-11-26 11:47:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-11-26 11:47:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2023-11-26 11:47:06,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2023-11-26 11:47:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2023-11-26 11:47:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2023-11-26 11:47:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2023-11-26 11:47:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2023-11-26 11:47:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2023-11-26 11:47:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2023-11-26 11:47:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2023-11-26 11:47:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2023-11-26 11:47:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-26 11:47:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-26 11:47:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-26 11:47:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-26 11:47:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-26 11:47:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-11-26 11:47:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-11-26 11:47:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-11-26 11:47:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-11-26 11:47:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-11-26 11:47:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-11-26 11:47:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-11-26 11:47:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-11-26 11:47:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-11-26 11:47:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2023-11-26 11:47:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:47:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 11:47:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 11:47:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 11:47:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-26 11:47:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-11-26 11:47:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-11-26 11:47:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-11-26 11:47:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-11-26 11:47:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-11-26 11:47:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-11-26 11:47:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-11-26 11:47:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-11-26 11:47:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-11-26 11:47:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2023-11-26 11:47:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-26 11:47:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-26 11:47:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-26 11:47:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-26 11:47:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-11-26 11:47:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-11-26 11:47:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-11-26 11:47:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-11-26 11:47:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-11-26 11:47:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-11-26 11:47:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-11-26 11:47:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-11-26 11:47:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-11-26 11:47:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2023-11-26 11:47:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2023-11-26 11:47:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-11-26 11:47:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-11-26 11:47:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-11-26 11:47:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-11-26 11:47:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-11-26 11:47:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2023-11-26 11:47:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2023-11-26 11:47:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2023-11-26 11:47:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2023-11-26 11:47:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2023-11-26 11:47:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2023-11-26 11:47:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2023-11-26 11:47:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2023-11-26 11:47:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2023-11-26 11:47:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2023-11-26 11:47:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-26 11:47:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-26 11:47:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-26 11:47:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-26 11:47:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-26 11:47:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-11-26 11:47:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-11-26 11:47:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-11-26 11:47:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-11-26 11:47:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-11-26 11:47:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-11-26 11:47:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-11-26 11:47:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-11-26 11:47:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-11-26 11:47:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2023-11-26 11:47:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:47:06,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:47:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:47:06,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:47:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-26 11:47:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-26 11:47:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-11-26 11:47:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-11-26 11:47:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-11-26 11:47:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-11-26 11:47:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-11-26 11:47:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-11-26 11:47:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-11-26 11:47:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-11-26 11:47:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-11-26 11:47:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-11-26 11:47:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-11-26 11:47:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-11-26 11:47:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2023-11-26 11:47:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 11:47:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 11:47:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 11:47:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 11:47:06,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-26 11:47:06,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-11-26 11:47:06,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-11-26 11:47:06,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-11-26 11:47:06,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-11-26 11:47:06,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-11-26 11:47:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-11-26 11:47:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-11-26 11:47:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-11-26 11:47:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-11-26 11:47:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2023-11-26 11:47:06,485 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:47:06,488 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:47:08,578 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:47:08,686 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:47:08,687 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:47:08,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:08 BoogieIcfgContainer [2023-11-26 11:47:08,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:47:08,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:47:08,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:47:08,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:47:08,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:47:05" (1/3) ... [2023-11-26 11:47:08,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f21c8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:08, skipping insertion in model container [2023-11-26 11:47:08,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:05" (2/3) ... [2023-11-26 11:47:08,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f21c8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:08, skipping insertion in model container [2023-11-26 11:47:08,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:08" (3/3) ... [2023-11-26 11:47:08,711 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-3.i [2023-11-26 11:47:08,730 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:47:08,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:47:08,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:47:08,807 INFO L357 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, mHoare=true, 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;@4819485c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:47:08,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:47:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:47:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 11:47:08,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:08,838 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:08,838 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:08,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash 941451293, now seen corresponding path program 1 times [2023-11-26 11:47:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:08,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026547853] [2023-11-26 11:47:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:08,865 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 [2023-11-26 11:47:08,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:08,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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) [2023-11-26 11:47:08,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:47:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:09,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 11:47:09,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2023-11-26 11:47:09,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:47:09,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:47:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026547853] [2023-11-26 11:47:09,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026547853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:09,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:09,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:09,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317998654] [2023-11-26 11:47:09,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:09,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:47:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:47:09,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:47:09,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:09,523 INFO L87 Difference]: Start difference. First operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:47:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:09,623 INFO L93 Difference]: Finished difference Result 281 states and 444 transitions. [2023-11-26 11:47:09,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:47:09,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-11-26 11:47:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:09,635 INFO L225 Difference]: With dead ends: 281 [2023-11-26 11:47:09,635 INFO L226 Difference]: Without dead ends: 140 [2023-11-26 11:47:09,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:09,645 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:09,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-26 11:47:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-11-26 11:47:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.459016393442623) internal successors, (178), 122 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:47:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 210 transitions. [2023-11-26 11:47:09,734 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 210 transitions. Word has length 128 [2023-11-26 11:47:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:09,735 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 210 transitions. [2023-11-26 11:47:09,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:47:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 210 transitions. [2023-11-26 11:47:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 11:47:09,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:09,741 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:09,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:47:09,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:47:09,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:09,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash 488259973, now seen corresponding path program 1 times [2023-11-26 11:47:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:09,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118410071] [2023-11-26 11:47:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:09,951 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 [2023-11-26 11:47:09,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:09,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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) [2023-11-26 11:47:09,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:47:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:10,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:47:10,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-11-26 11:47:10,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:47:10,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:47:10,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118410071] [2023-11-26 11:47:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118410071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:10,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:10,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:47:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720200093] [2023-11-26 11:47:10,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:10,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:47:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:47:10,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:47:10,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:47:10,597 INFO L87 Difference]: Start difference. First operand 140 states and 210 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:47:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:10,767 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2023-11-26 11:47:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:47:10,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-11-26 11:47:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:10,771 INFO L225 Difference]: With dead ends: 285 [2023-11-26 11:47:10,771 INFO L226 Difference]: Without dead ends: 146 [2023-11-26 11:47:10,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:10,774 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:10,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 607 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:47:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-26 11:47:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-11-26 11:47:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 124 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:47:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2023-11-26 11:47:10,791 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 128 [2023-11-26 11:47:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:10,793 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2023-11-26 11:47:10,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:47:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2023-11-26 11:47:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 11:47:10,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:10,796 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:10,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:47:11,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:47:11,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:11,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:11,006 INFO L85 PathProgramCache]: Analyzing trace with hash 882626759, now seen corresponding path program 1 times [2023-11-26 11:47:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973552844] [2023-11-26 11:47:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:11,008 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 [2023-11-26 11:47:11,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:11,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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) [2023-11-26 11:47:11,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:47:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:11,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:47:11,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:11,938 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 [2023-11-26 11:47:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:47:11,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:47:11,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:47:11,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973552844] [2023-11-26 11:47:11,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973552844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:11,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:11,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:47:11,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123500781] [2023-11-26 11:47:11,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:11,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:47:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:47:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:47:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:47:11,962 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:47:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:12,081 INFO L93 Difference]: Finished difference Result 424 states and 634 transitions. [2023-11-26 11:47:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:47:12,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-11-26 11:47:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:12,086 INFO L225 Difference]: With dead ends: 424 [2023-11-26 11:47:12,086 INFO L226 Difference]: Without dead ends: 283 [2023-11-26 11:47:12,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:12,089 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 139 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:12,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 801 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:47:12,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-26 11:47:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2023-11-26 11:47:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 243 states have (on average 1.448559670781893) internal successors, (352), 243 states have internal predecessors, (352), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 11:47:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 416 transitions. [2023-11-26 11:47:12,122 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 416 transitions. Word has length 128 [2023-11-26 11:47:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:12,123 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 416 transitions. [2023-11-26 11:47:12,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:47:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 416 transitions. [2023-11-26 11:47:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-26 11:47:12,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:12,131 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:12,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:47:12,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:47:12,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:12,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1258206367, now seen corresponding path program 1 times [2023-11-26 11:47:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:12,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77825798] [2023-11-26 11:47:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:12,334 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 [2023-11-26 11:47:12,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:12,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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) [2023-11-26 11:47:12,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae00df1b-734d-4c67-b8e6-18a0c0924db9/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:47:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:12,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-26 11:47:12,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:13,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 46 treesize of output 34 [2023-11-26 11:47:13,418 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 [2023-11-26 11:47:13,446 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 [2023-11-26 11:47:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-11-26 11:47:13,472 INFO L327 TraceCheckSpWp]: Computing backward predicates...