./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:57:06,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:57:07,088 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:57:07,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:57:07,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:57:07,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:57:07,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:57:07,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:57:07,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:57:07,163 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:57:07,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:57:07,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:57:07,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:57:07,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:57:07,166 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:57:07,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:57:07,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:57:07,167 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:57:07,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:57:07,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:57:07,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:57:07,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:57:07,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:57:07,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:57:07,171 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:57:07,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:57:07,172 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:57:07,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:57:07,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:57:07,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:57:07,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:57:07,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:57:07,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:57:07,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:57:07,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:57:07,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:57:07,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:57:07,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:57:07,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:57:07,177 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:57:07,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:57:07,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:57:07,178 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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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 -> 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 [2023-11-26 11:57:07,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:57:07,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:57:07,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:57:07,606 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:57:07,606 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:57:07,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2023-11-26 11:57:10,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:57:11,034 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:57:11,036 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2023-11-26 11:57:11,049 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/data/0b77a7c62/605f43fee50d4c3bbc9f503c4fad76dc/FLAG5ece42ba4 [2023-11-26 11:57:11,066 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/data/0b77a7c62/605f43fee50d4c3bbc9f503c4fad76dc [2023-11-26 11:57:11,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:57:11,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:57:11,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:57:11,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:57:11,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:57:11,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19306802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11, skipping insertion in model container [2023-11-26 11:57:11,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,125 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:57:11,323 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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i[916,929] [2023-11-26 11:57:11,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:57:11,436 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:57:11,447 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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i[916,929] [2023-11-26 11:57:11,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:57:11,518 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:57:11,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11 WrapperNode [2023-11-26 11:57:11,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:57:11,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:57:11,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:57:11,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:57:11,532 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:57:11" (1/1) ... [2023-11-26 11:57:11,572 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:57:11" (1/1) ... [2023-11-26 11:57:11,632 INFO L138 Inliner]: procedures = 29, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 566 [2023-11-26 11:57:11,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:57:11,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:57:11,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:57:11,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:57:11,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,699 INFO L175 MemorySlicer]: Split 166 memory accesses to 2 slices as follows [2, 164]. 99 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 17 writes are split as follows [0, 17]. [2023-11-26 11:57:11,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:57:11,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:57:11,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:57:11,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:57:11,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (1/1) ... [2023-11-26 11:57:11,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:57:11,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:57:11,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:11,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:11,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:57:11,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-26 11:57:11,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-26 11:57:11,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:57:11,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:57:11,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-26 11:57:11,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-26 11:57:11,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:57:11,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:57:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-26 11:57:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-26 11:57:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:57:11,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:57:11,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:57:11,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:57:11,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:57:11,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:57:12,081 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:57:12,084 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:57:12,883 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:57:12,946 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:57:12,951 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:57:12,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:12 BoogieIcfgContainer [2023-11-26 11:57:12,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:57:12,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:57:12,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:57:12,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:57:12,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:57:11" (1/3) ... [2023-11-26 11:57:12,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d725269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:57:12, skipping insertion in model container [2023-11-26 11:57:12,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:11" (2/3) ... [2023-11-26 11:57:12,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d725269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:57:12, skipping insertion in model container [2023-11-26 11:57:12,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:12" (3/3) ... [2023-11-26 11:57:12,965 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-49.i [2023-11-26 11:57:12,987 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:57:12,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:57:13,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:57:13,100 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;@e53fd0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:57:13,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:57:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 110 states have (on average 1.509090909090909) internal successors, (166), 111 states have internal predecessors, (166), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-26 11:57:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-26 11:57:13,173 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:13,174 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:13,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:13,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1651977093, now seen corresponding path program 1 times [2023-11-26 11:57:13,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:13,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120713883] [2023-11-26 11:57:13,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:13,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 11:57:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:57:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:57:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:57:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:57:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:57:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:57:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:57:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:57:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:57:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:57:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:57:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:57:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:57:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-26 11:57:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120713883] [2023-11-26 11:57:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120713883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764908943] [2023-11-26 11:57:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:13,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:57:13,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:13,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:57:13,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:57:13,754 INFO L87 Difference]: Start difference. First operand has 127 states, 110 states have (on average 1.509090909090909) internal successors, (166), 111 states have internal predecessors, (166), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:13,841 INFO L93 Difference]: Finished difference Result 251 states and 400 transitions. [2023-11-26 11:57:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:57:13,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2023-11-26 11:57:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:13,861 INFO L225 Difference]: With dead ends: 251 [2023-11-26 11:57:13,861 INFO L226 Difference]: Without dead ends: 125 [2023-11-26 11:57:13,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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:57:13,873 INFO L413 NwaCegarLoop]: 185 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, 185 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:57:13,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:57:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-26 11:57:13,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-26 11:57:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 109 states have internal predecessors, (161), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-26 11:57:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 189 transitions. [2023-11-26 11:57:13,954 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 189 transitions. Word has length 112 [2023-11-26 11:57:13,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:13,955 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 189 transitions. [2023-11-26 11:57:13,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 189 transitions. [2023-11-26 11:57:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-26 11:57:13,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:13,966 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:13,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:57:13,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:13,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -639977171, now seen corresponding path program 1 times [2023-11-26 11:57:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954933828] [2023-11-26 11:57:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:13,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 11:57:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:57:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:57:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:57:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:57:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:57:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:57:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:57:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:57:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:57:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:57:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:57:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:57:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:57:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-26 11:57:14,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:14,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954933828] [2023-11-26 11:57:14,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954933828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:14,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:14,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:57:14,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485206779] [2023-11-26 11:57:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:14,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:57:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:57:14,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:57:14,983 INFO L87 Difference]: Start difference. First operand 125 states and 189 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-26 11:57:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:15,812 INFO L93 Difference]: Finished difference Result 395 states and 598 transitions. [2023-11-26 11:57:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:57:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2023-11-26 11:57:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:15,817 INFO L225 Difference]: With dead ends: 395 [2023-11-26 11:57:15,817 INFO L226 Difference]: Without dead ends: 271 [2023-11-26 11:57:15,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:57:15,824 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 238 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:15,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 687 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 11:57:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-26 11:57:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 129. [2023-11-26 11:57:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 113 states have (on average 1.4690265486725664) internal successors, (166), 113 states have internal predecessors, (166), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-26 11:57:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 194 transitions. [2023-11-26 11:57:15,866 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 194 transitions. Word has length 112 [2023-11-26 11:57:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:15,870 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 194 transitions. [2023-11-26 11:57:15,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-26 11:57:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 194 transitions. [2023-11-26 11:57:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-26 11:57:15,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:15,876 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:15,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:57:15,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:15,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1629494226, now seen corresponding path program 1 times [2023-11-26 11:57:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:15,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096140575] [2023-11-26 11:57:15,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:15,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 11:57:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:57:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:57:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:57:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:57:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:57:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:57:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:57:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:57:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:57:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:57:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:57:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:57:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:57:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-11-26 11:57:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:16,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096140575] [2023-11-26 11:57:16,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096140575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:16,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:16,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:57:16,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276600619] [2023-11-26 11:57:16,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:16,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:57:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:57:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:57:16,958 INFO L87 Difference]: Start difference. First operand 129 states and 194 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:17,691 INFO L93 Difference]: Finished difference Result 265 states and 394 transitions. [2023-11-26 11:57:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:57:17,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2023-11-26 11:57:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:17,694 INFO L225 Difference]: With dead ends: 265 [2023-11-26 11:57:17,694 INFO L226 Difference]: Without dead ends: 137 [2023-11-26 11:57:17,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-26 11:57:17,697 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 156 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:17,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 281 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:57:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-26 11:57:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2023-11-26 11:57:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 116 states have internal predecessors, (168), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-26 11:57:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2023-11-26 11:57:17,719 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 114 [2023-11-26 11:57:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:17,723 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2023-11-26 11:57:17,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2023-11-26 11:57:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-26 11:57:17,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:17,725 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:17,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:57:17,726 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:17,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1342916486, now seen corresponding path program 1 times [2023-11-26 11:57:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823164421] [2023-11-26 11:57:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 11:57:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:57:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:57:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:57:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:57:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:57:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:57:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:57:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:57:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:57:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:57:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:21,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:57:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:57:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:21,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:57:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-26 11:57:21,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:21,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823164421] [2023-11-26 11:57:21,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823164421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:21,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:21,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-26 11:57:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099592032] [2023-11-26 11:57:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:21,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-26 11:57:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-26 11:57:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2023-11-26 11:57:21,021 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-26 11:57:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:26,140 INFO L93 Difference]: Finished difference Result 513 states and 759 transitions. [2023-11-26 11:57:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-26 11:57:26,141 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2023-11-26 11:57:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:26,145 INFO L225 Difference]: With dead ends: 513 [2023-11-26 11:57:26,145 INFO L226 Difference]: Without dead ends: 381 [2023-11-26 11:57:26,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=191, Invalid=1141, Unknown=0, NotChecked=0, Total=1332 [2023-11-26 11:57:26,148 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 1014 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:26,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1124 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-26 11:57:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-11-26 11:57:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 339. [2023-11-26 11:57:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 309 states have (on average 1.4789644012944985) internal successors, (457), 311 states have internal predecessors, (457), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-26 11:57:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 505 transitions. [2023-11-26 11:57:26,186 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 505 transitions. Word has length 116 [2023-11-26 11:57:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:26,187 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 505 transitions. [2023-11-26 11:57:26,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-26 11:57:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 505 transitions. [2023-11-26 11:57:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-26 11:57:26,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:26,190 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:26,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:57:26,190 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:26,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash -662858116, now seen corresponding path program 1 times [2023-11-26 11:57:26,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:26,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080161495] [2023-11-26 11:57:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 11:57:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:57:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:57:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:57:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:57:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:57:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:57:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:57:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:57:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:57:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:57:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:57:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:57:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:57:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-26 11:57:26,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080161495] [2023-11-26 11:57:26,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080161495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:26,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:26,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:57:26,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226445255] [2023-11-26 11:57:26,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:26,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:57:26,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:26,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:57:26,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:57:26,931 INFO L87 Difference]: Start difference. First operand 339 states and 505 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:27,605 INFO L93 Difference]: Finished difference Result 860 states and 1283 transitions. [2023-11-26 11:57:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:57:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2023-11-26 11:57:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:27,615 INFO L225 Difference]: With dead ends: 860 [2023-11-26 11:57:27,615 INFO L226 Difference]: Without dead ends: 522 [2023-11-26 11:57:27,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:57:27,621 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 210 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:27,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 390 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:57:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-11-26 11:57:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 448. [2023-11-26 11:57:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 409 states have (on average 1.4767726161369192) internal successors, (604), 412 states have internal predecessors, (604), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 11:57:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 668 transitions. [2023-11-26 11:57:27,677 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 668 transitions. Word has length 116 [2023-11-26 11:57:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:27,678 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 668 transitions. [2023-11-26 11:57:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 668 transitions. [2023-11-26 11:57:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-26 11:57:27,681 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:27,681 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:27,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:57:27,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:27,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash -561144895, now seen corresponding path program 1 times [2023-11-26 11:57:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:27,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244216600] [2023-11-26 11:57:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 11:57:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:57:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:57:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:57:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:57:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:57:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:57:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:57:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:57:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:57:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:57:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:57:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:57:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:57:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-11-26 11:57:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244216600] [2023-11-26 11:57:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244216600] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:57:28,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877430833] [2023-11-26 11:57:28,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:28,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:57:28,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:57:28,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:57:28,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:57:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:28,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-26 11:57:28,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:57:29,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-26 11:57:29,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-26 11:57:29,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-26 11:57:29,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:57:29,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2023-11-26 11:57:29,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:57:29,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 19 [2023-11-26 11:57:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-26 11:57:29,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:57:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-11-26 11:57:29,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877430833] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:57:29,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:57:29,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 17 [2023-11-26 11:57:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127477956] [2023-11-26 11:57:29,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:57:29,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-26 11:57:29,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-26 11:57:29,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-11-26 11:57:29,864 INFO L87 Difference]: Start difference. First operand 448 states and 668 transitions. Second operand has 17 states, 14 states have (on average 5.5) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 6 states have call successors, (20) [2023-11-26 11:57:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:32,751 INFO L93 Difference]: Finished difference Result 1262 states and 1870 transitions. [2023-11-26 11:57:32,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-26 11:57:32,752 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 5.5) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 6 states have call successors, (20) Word has length 116 [2023-11-26 11:57:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:32,758 INFO L225 Difference]: With dead ends: 1262 [2023-11-26 11:57:32,759 INFO L226 Difference]: Without dead ends: 815 [2023-11-26 11:57:32,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 249 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2023-11-26 11:57:32,764 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 431 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:32,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 640 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-26 11:57:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2023-11-26 11:57:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 464. [2023-11-26 11:57:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 424 states have (on average 1.471698113207547) internal successors, (624), 427 states have internal predecessors, (624), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-26 11:57:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 688 transitions. [2023-11-26 11:57:32,857 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 688 transitions. Word has length 116 [2023-11-26 11:57:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:32,858 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 688 transitions. [2023-11-26 11:57:32,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 5.5) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 6 states have call successors, (20) [2023-11-26 11:57:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 688 transitions. [2023-11-26 11:57:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-26 11:57:32,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:32,863 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:32,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:57:33,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:57:33,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:33,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:33,072 INFO L85 PathProgramCache]: Analyzing trace with hash -302979457, now seen corresponding path program 1 times [2023-11-26 11:57:33,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523254465] [2023-11-26 11:57:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:57:33,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:57:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:57:33,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:57:33,340 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:57:33,342 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:57:33,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:57:33,348 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:33,353 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:57:33,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-26 11:57:33,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-26 11:57:33,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-26 11:57:33,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short79 could not be translated [2023-11-26 11:57:33,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-26 11:57:33,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short75 could not be translated [2023-11-26 11:57:33,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-26 11:57:33,431 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short75 could not be translated [2023-11-26 11:57:33,431 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-26 11:57:33,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-26 11:57:33,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short79 could not be translated [2023-11-26 11:57:33,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated [2023-11-26 11:57:33,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated [2023-11-26 11:57:33,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated [2023-11-26 11:57:33,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated [2023-11-26 11:57:33,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated [2023-11-26 11:57:33,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short83 could not be translated [2023-11-26 11:57:33,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-26 11:57:33,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated [2023-11-26 11:57:33,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-26 11:57:33,436 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short83 could not be translated [2023-11-26 11:57:33,436 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated [2023-11-26 11:57:33,437 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-26 11:57:33,437 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-26 11:57:33,438 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-26 11:57:33,439 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-26 11:57:33,440 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-26 11:57:33,441 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated [2023-11-26 11:57:33,441 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-26 11:57:33,442 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-26 11:57:33,443 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem101 could not be translated [2023-11-26 11:57:33,443 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated [2023-11-26 11:57:33,444 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem104 could not be translated [2023-11-26 11:57:33,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated [2023-11-26 11:57:33,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-26 11:57:33,446 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated [2023-11-26 11:57:33,446 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite7 could not be translated [2023-11-26 11:57:33,446 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated [2023-11-26 11:57:33,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-26 11:57:33,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated [2023-11-26 11:57:33,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated [2023-11-26 11:57:33,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated [2023-11-26 11:57:33,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-26 11:57:33,449 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-26 11:57:33,449 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated [2023-11-26 11:57:33,450 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated [2023-11-26 11:57:33,450 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-26 11:57:33,451 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short164 could not be translated [2023-11-26 11:57:33,451 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated [2023-11-26 11:57:33,452 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated [2023-11-26 11:57:33,452 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-26 11:57:33,452 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short164 could not be translated [2023-11-26 11:57:33,453 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated [2023-11-26 11:57:33,453 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short175 could not be translated [2023-11-26 11:57:33,453 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-26 11:57:33,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated [2023-11-26 11:57:33,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short175 could not be translated [2023-11-26 11:57:33,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-26 11:57:33,455 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated [2023-11-26 11:57:33,455 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short191 could not be translated [2023-11-26 11:57:33,455 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short164 could not be translated [2023-11-26 11:57:33,455 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated [2023-11-26 11:57:33,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:57:33 BoogieIcfgContainer [2023-11-26 11:57:33,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:57:33,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:57:33,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:57:33,489 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:57:33,489 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:12" (3/4) ... [2023-11-26 11:57:33,492 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:57:33,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:57:33,494 INFO L158 Benchmark]: Toolchain (without parser) took 22420.43ms. Allocated memory was 192.9MB in the beginning and 335.5MB in the end (delta: 142.6MB). Free memory was 145.9MB in the beginning and 255.0MB in the end (delta: -109.0MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2023-11-26 11:57:33,495 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 192.9MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:57:33,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.65ms. Allocated memory is still 192.9MB. Free memory was 145.8MB in the beginning and 128.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 11:57:33,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.71ms. Allocated memory is still 192.9MB. Free memory was 128.3MB in the beginning and 122.9MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:57:33,496 INFO L158 Benchmark]: Boogie Preprocessor took 167.99ms. Allocated memory is still 192.9MB. Free memory was 122.9MB in the beginning and 116.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 11:57:33,497 INFO L158 Benchmark]: RCFGBuilder took 1149.93ms. Allocated memory is still 192.9MB. Free memory was 116.6MB in the beginning and 73.3MB in the end (delta: 43.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2023-11-26 11:57:33,498 INFO L158 Benchmark]: TraceAbstraction took 20532.40ms. Allocated memory was 192.9MB in the beginning and 335.5MB in the end (delta: 142.6MB). Free memory was 72.6MB in the beginning and 255.0MB in the end (delta: -182.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:57:33,498 INFO L158 Benchmark]: Witness Printer took 5.54ms. Allocated memory is still 335.5MB. Free memory is still 255.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:57:33,502 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.33ms. Allocated memory is still 192.9MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.65ms. Allocated memory is still 192.9MB. Free memory was 145.8MB in the beginning and 128.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.71ms. Allocated memory is still 192.9MB. Free memory was 128.3MB in the beginning and 122.9MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 167.99ms. Allocated memory is still 192.9MB. Free memory was 122.9MB in the beginning and 116.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1149.93ms. Allocated memory is still 192.9MB. Free memory was 116.6MB in the beginning and 73.3MB in the end (delta: 43.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20532.40ms. Allocated memory was 192.9MB in the beginning and 335.5MB in the end (delta: 142.6MB). Free memory was 72.6MB in the beginning and 255.0MB in the end (delta: -182.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.54ms. Allocated memory is still 335.5MB. Free memory is still 255.0MB. 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~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short79 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short79 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem101 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem102 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem104 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short164 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short164 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short175 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short175 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short191 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short164 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite158 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 someBinaryFLOATComparisonOperation at line 108. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] FCALL updateLastVariables() [L116] CALL updateVariables() [L82] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L83] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L85] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] RET updateVariables() [L117] CALL step() [L54] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L54] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L54] EXPR WrapperStruct00.var_1_9 [L54] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1] [L54] WrapperStruct00.var_1_8 = ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) [L55] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] EXPR 50 >> WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] COND FALSE !((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) [L58] EXPR WrapperStruct00.var_1_11 [L58] WrapperStruct00.var_1_10 = (! WrapperStruct00.var_1_11) [L60] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] COND TRUE ! WrapperStruct00.var_1_12 [L61] EXPR WrapperStruct00.var_1_4 [L61] EXPR WrapperStruct00.var_1_6 [L61] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L61] EXPR ((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8) [L61] EXPR WrapperStruct00.var_1_8 [L61] EXPR ((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1] [L61] COND FALSE !(WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) [L64] EXPR WrapperStruct00.var_1_11 [L64] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_11 [L67] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND TRUE WrapperStruct00.var_1_2 >= 64.5f [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] COND FALSE !(WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) [L71] WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L71] COND FALSE !(WrapperStruct00.var_1_13) [L74] EXPR WrapperStruct00.var_1_6 [L74] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50)) [L108] EXPR WrapperStruct00.var_1_1 [L108] EXPR (WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50)) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11))))) && ((! WrapperStruct00.var_1_12) ? ((WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_10 && WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_11))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11))))) && ((! WrapperStruct00.var_1_12) ? ((WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_10 && WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_11))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108-L109] return ((((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11))))) && ((! WrapperStruct00.var_1_12) ? ((WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_10 && WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_11))) : 1) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2085 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2049 mSDsluCounter, 3307 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2567 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5889 IncrementalHoareTripleChecker+Invalid, 6078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 740 mSDtfsCounter, 5889 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 433 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=464occurred in iteration=6, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 613 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 910 ConstructedInterpolants, 0 QuantifiedInterpolants, 4090 SizeOfPredicates, 8 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2894/2912 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:57:33,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:57:36,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:57:36,632 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:57:36,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:57:36,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:57:36,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:57:36,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:57:36,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:57:36,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:57:36,712 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:57:36,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:57:36,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:57:36,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:57:36,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:57:36,718 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:57:36,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:57:36,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:57:36,720 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:57:36,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:57:36,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:57:36,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:57:36,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:57:36,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:57:36,724 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:57:36,725 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:57:36,725 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:57:36,726 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:57:36,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:57:36,727 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:57:36,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:57:36,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:57:36,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:57:36,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:57:36,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:57:36,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:57:36,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:57:36,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:57:36,732 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:57:36,733 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:57:36,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:57:36,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:57:36,734 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:57:36,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:57:36,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:57:36,735 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:57:36,735 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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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 -> 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 [2023-11-26 11:57:37,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:57:37,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:57:37,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:57:37,252 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:57:37,252 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:57:37,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2023-11-26 11:57:41,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:57:41,504 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:57:41,505 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2023-11-26 11:57:41,520 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/data/2f327ad8b/d0141bc6eca84a9781b5bc5bbf94c173/FLAGc00401523 [2023-11-26 11:57:41,543 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/data/2f327ad8b/d0141bc6eca84a9781b5bc5bbf94c173 [2023-11-26 11:57:41,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:57:41,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:57:41,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:57:41,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:57:41,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:57:41,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:41" (1/1) ... [2023-11-26 11:57:41,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35023fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:41, skipping insertion in model container [2023-11-26 11:57:41,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:41" (1/1) ... [2023-11-26 11:57:41,616 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:57:41,882 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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i[916,929] [2023-11-26 11:57:42,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:57:42,053 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:57:42,075 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_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i[916,929] [2023-11-26 11:57:42,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:57:42,231 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:57:42,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42 WrapperNode [2023-11-26 11:57:42,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:57:42,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:57:42,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:57:42,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:57:42,247 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:57:42" (1/1) ... [2023-11-26 11:57:42,294 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:57:42" (1/1) ... [2023-11-26 11:57:42,387 INFO L138 Inliner]: procedures = 33, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 556 [2023-11-26 11:57:42,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:57:42,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:57:42,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:57:42,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:57:42,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,473 INFO L175 MemorySlicer]: Split 166 memory accesses to 2 slices as follows [2, 164]. 99 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 17 writes are split as follows [0, 17]. [2023-11-26 11:57:42,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:57:42,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:57:42,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:57:42,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:57:42,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (1/1) ... [2023-11-26 11:57:42,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:57:42,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:57:42,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:42,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:42,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:57:42,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-26 11:57:42,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-26 11:57:42,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-11-26 11:57:42,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-11-26 11:57:42,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:57:42,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 11:57:42,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-11-26 11:57:42,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-11-26 11:57:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-11-26 11:57:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-11-26 11:57:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-11-26 11:57:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-11-26 11:57:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-11-26 11:57:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-11-26 11:57:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:57:42,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:57:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:57:42,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:57:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-26 11:57:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-26 11:57:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-11-26 11:57:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-11-26 11:57:42,990 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:57:42,993 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:57:43,869 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:57:43,931 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:57:43,931 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:57:43,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:43 BoogieIcfgContainer [2023-11-26 11:57:43,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:57:43,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:57:43,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:57:43,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:57:43,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:57:41" (1/3) ... [2023-11-26 11:57:43,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:57:43, skipping insertion in model container [2023-11-26 11:57:43,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:42" (2/3) ... [2023-11-26 11:57:43,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:57:43, skipping insertion in model container [2023-11-26 11:57:43,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:43" (3/3) ... [2023-11-26 11:57:43,993 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-49.i [2023-11-26 11:57:44,020 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:57:44,020 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:57:44,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:57:44,118 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;@2da7aebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:57:44,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:57:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-26 11:57:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-26 11:57:44,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:44,154 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:44,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:44,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1137980605, now seen corresponding path program 1 times [2023-11-26 11:57:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:57:44,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861219450] [2023-11-26 11:57:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:44,188 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:57:44,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:57:44,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:44,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:44,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 11:57:44,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:57:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-11-26 11:57:44,789 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:57:44,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:57:44,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861219450] [2023-11-26 11:57:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861219450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:44,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:44,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402149324] [2023-11-26 11:57:44,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:44,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:57:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:57:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:57:44,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:57:44,843 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:44,910 INFO L93 Difference]: Finished difference Result 243 states and 388 transitions. [2023-11-26 11:57:44,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:57:44,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2023-11-26 11:57:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:44,926 INFO L225 Difference]: With dead ends: 243 [2023-11-26 11:57:44,926 INFO L226 Difference]: Without dead ends: 121 [2023-11-26 11:57:44,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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:57:44,936 INFO L413 NwaCegarLoop]: 179 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, 179 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:57:44,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:57:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-26 11:57:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-26 11:57:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 105 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-26 11:57:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2023-11-26 11:57:45,002 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 110 [2023-11-26 11:57:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:45,003 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2023-11-26 11:57:45,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2023-11-26 11:57:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-26 11:57:45,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:45,010 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:45,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:45,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:45,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:45,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash -152657173, now seen corresponding path program 1 times [2023-11-26 11:57:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:57:45,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262068424] [2023-11-26 11:57:45,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:45,222 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:57:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:57:45,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:45,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:45,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-26 11:57:45,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:57:45,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-26 11:57:45,918 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 37 treesize of output 25 [2023-11-26 11:57:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-26 11:57:45,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:57:45,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:57:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262068424] [2023-11-26 11:57:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262068424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:57:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379625709] [2023-11-26 11:57:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:45,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:57:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:57:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:57:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:57:45,966 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-26 11:57:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:47,501 INFO L93 Difference]: Finished difference Result 381 states and 577 transitions. [2023-11-26 11:57:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:57:47,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2023-11-26 11:57:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:47,508 INFO L225 Difference]: With dead ends: 381 [2023-11-26 11:57:47,508 INFO L226 Difference]: Without dead ends: 261 [2023-11-26 11:57:47,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:57:47,512 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 226 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:47,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 659 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-26 11:57:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-26 11:57:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 125. [2023-11-26 11:57:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.4678899082568808) internal successors, (160), 109 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-26 11:57:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2023-11-26 11:57:47,543 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 110 [2023-11-26 11:57:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:47,546 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2023-11-26 11:57:47,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-26 11:57:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2023-11-26 11:57:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-26 11:57:47,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:47,551 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:47,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:47,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:47,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:47,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1270061776, now seen corresponding path program 1 times [2023-11-26 11:57:47,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:57:47,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900871198] [2023-11-26 11:57:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:47,763 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:57:47,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:57:47,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:47,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:48,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-26 11:57:48,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:57:48,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-26 11:57:48,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-26 11:57:48,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-26 11:57:48,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-26 11:57:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-11-26 11:57:48,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:57:48,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:57:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900871198] [2023-11-26 11:57:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900871198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:48,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:57:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177599117] [2023-11-26 11:57:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:48,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:57:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:57:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:57:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:57:48,581 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:57:50,471 INFO L93 Difference]: Finished difference Result 257 states and 382 transitions. [2023-11-26 11:57:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:57:50,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2023-11-26 11:57:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:57:50,477 INFO L225 Difference]: With dead ends: 257 [2023-11-26 11:57:50,478 INFO L226 Difference]: Without dead ends: 133 [2023-11-26 11:57:50,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-26 11:57:50,481 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 152 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:57:50,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 261 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-26 11:57:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-26 11:57:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2023-11-26 11:57:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 112 states have internal predecessors, (162), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-26 11:57:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2023-11-26 11:57:50,505 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 112 [2023-11-26 11:57:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:57:50,506 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2023-11-26 11:57:50,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-26 11:57:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2023-11-26 11:57:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-26 11:57:50,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:57:50,511 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:50,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:50,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:50,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:57:50,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:50,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750218, now seen corresponding path program 1 times [2023-11-26 11:57:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:57:50,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158042995] [2023-11-26 11:57:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:50,724 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:57:50,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:57:50,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:50,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbc0cbbb-5e89-45ef-a963-5f12ee16c548/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:57:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:51,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-26 11:57:51,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:57:51,272 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 14 treesize of output 10 [2023-11-26 11:57:51,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-26 11:57:51,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-11-26 11:57:51,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2023-11-26 11:57:52,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:57:52,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 58 [2023-11-26 11:57:52,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:57:52,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 84 [2023-11-26 11:57:53,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:57:53,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 87