./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX --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 fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:49:44,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:49:44,726 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:49:44,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:49:44,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:49:44,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:49:44,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:49:44,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:49:44,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:49:44,763 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:49:44,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:49:44,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:49:44,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:49:44,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:49:44,766 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:49:44,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:49:44,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:49:44,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:49:44,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:49:44,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:49:44,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:49:44,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:49:44,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:49:44,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:49:44,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:49:44,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:49:44,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:49:44,776 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:49:44,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:49:44,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:49:44,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:49:44,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:49:44,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:49:44,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:49:44,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:49:44,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:49:44,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:49:44,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:49:44,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:49:44,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:49:44,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:49:44,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:49:44,791 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_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/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_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX 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 -> fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f [2024-11-08 16:49:45,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:49:45,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:49:45,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:49:45,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:49:45,118 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:49:45,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i Unable to find full path for "g++" [2024-11-08 16:49:47,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:49:47,416 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:49:47,416 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2024-11-08 16:49:47,434 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/data/491d0dacf/6953f1bf45ba49fcae0b9d1b4c683c15/FLAG344463ac5 [2024-11-08 16:49:47,454 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/data/491d0dacf/6953f1bf45ba49fcae0b9d1b4c683c15 [2024-11-08 16:49:47,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:49:47,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:49:47,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:49:47,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:49:47,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:49:47,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:47,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f8aeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47, skipping insertion in model container [2024-11-08 16:49:47,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:47,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:49:47,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i[916,929] [2024-11-08 16:49:47,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:49:47,850 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:49:47,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i[916,929] [2024-11-08 16:49:47,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:49:47,946 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:49:47,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47 WrapperNode [2024-11-08 16:49:47,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:49:47,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:49:47,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:49:47,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:49:47,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:47,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,037 INFO L138 Inliner]: procedures = 30, calls = 208, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 593 [2024-11-08 16:49:48,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:49:48,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:49:48,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:49:48,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:49:48,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,066 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 16:49:48,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:49:48,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:49:48,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:49:48,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:49:48,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (1/1) ... [2024-11-08 16:49:48,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:49:48,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:49:48,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:49:48,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:49:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:49:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 16:49:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 16:49:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 16:49:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:49:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 16:49:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:49:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:49:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:49:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:49:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:49:48,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:49:48,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:49:48,370 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:49:49,183 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2024-11-08 16:49:49,183 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:49:49,205 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:49:49,205 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:49:49,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:49 BoogieIcfgContainer [2024-11-08 16:49:49,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:49:49,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:49:49,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:49:49,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:49:49,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:49:47" (1/3) ... [2024-11-08 16:49:49,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4542b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:49:49, skipping insertion in model container [2024-11-08 16:49:49,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:47" (2/3) ... [2024-11-08 16:49:49,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4542b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:49:49, skipping insertion in model container [2024-11-08 16:49:49,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:49" (3/3) ... [2024-11-08 16:49:49,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-50.i [2024-11-08 16:49:49,237 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:49:49,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:49:49,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:49:49,315 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1bfd05dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:49:49,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:49:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 101 states have (on average 1.386138613861386) internal successors, (140), 102 states have internal predecessors, (140), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:49:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 16:49:49,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:49,342 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:49,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:49,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash -972690476, now seen corresponding path program 1 times [2024-11-08 16:49:49,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:49:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225606582] [2024-11-08 16:49:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:49,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:49:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:49,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 16:49:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:49:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:49:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:49:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:49:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:49:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:49:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:49:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:49:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:49:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:49:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:49:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:49:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:49:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:49:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:49:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:49:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:49:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:49:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:49:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 16:49:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 16:49:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 16:49:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 16:49:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 16:49:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 16:49:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 16:49:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:49:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225606582] [2024-11-08 16:49:50,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225606582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:50,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:50,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:49:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696340369] [2024-11-08 16:49:50,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:50,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:49:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:49:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:49:50,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:49:50,238 INFO L87 Difference]: Start difference. First operand has 130 states, 101 states have (on average 1.386138613861386) internal successors, (140), 102 states have internal predecessors, (140), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:49:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:50,298 INFO L93 Difference]: Finished difference Result 253 states and 404 transitions. [2024-11-08 16:49:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:49:50,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-08 16:49:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:50,310 INFO L225 Difference]: With dead ends: 253 [2024-11-08 16:49:50,310 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 16:49:50,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:49:50,318 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:50,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:49:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 16:49:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-08 16:49:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:49:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-08 16:49:50,403 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 195 [2024-11-08 16:49:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:50,404 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-08 16:49:50,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:49:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-08 16:49:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 16:49:50,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:50,413 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:50,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:49:50,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:50,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1136422104, now seen corresponding path program 1 times [2024-11-08 16:49:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:49:50,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34125363] [2024-11-08 16:49:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:50,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:49:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 16:49:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:49:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:49:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:49:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:49:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:49:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:49:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:49:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:49:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:49:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:49:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:49:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:49:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:49:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:49:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:49:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:49:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:49:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:49:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:49:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 16:49:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 16:49:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 16:49:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 16:49:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 16:49:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 16:49:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 16:49:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:49:54,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34125363] [2024-11-08 16:49:54,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34125363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:54,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:54,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:49:54,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057667050] [2024-11-08 16:49:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:54,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:49:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:49:54,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:49:54,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:49:54,355 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:49:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:55,544 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2024-11-08 16:49:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:49:55,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-08 16:49:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:55,552 INFO L225 Difference]: With dead ends: 322 [2024-11-08 16:49:55,552 INFO L226 Difference]: Without dead ends: 199 [2024-11-08 16:49:55,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:49:55,554 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 95 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:55,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 857 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:49:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-08 16:49:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-11-08 16:49:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 159 states have (on average 1.3773584905660377) internal successors, (219), 160 states have internal predecessors, (219), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:49:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 287 transitions. [2024-11-08 16:49:55,585 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 287 transitions. Word has length 195 [2024-11-08 16:49:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:55,590 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 287 transitions. [2024-11-08 16:49:55,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:49:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 287 transitions. [2024-11-08 16:49:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 16:49:55,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:55,598 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:55,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:49:55,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:55,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash -271631839, now seen corresponding path program 1 times [2024-11-08 16:49:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:49:55,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893795957] [2024-11-08 16:49:55,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:55,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:49:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:49:55,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:49:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:49:56,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:49:56,198 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:49:56,199 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:49:56,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:49:56,206 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 16:49:56,304 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:49:56,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:49:56 BoogieIcfgContainer [2024-11-08 16:49:56,308 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:49:56,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:49:56,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:49:56,309 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:49:56,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:49" (3/4) ... [2024-11-08 16:49:56,312 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:49:56,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:49:56,314 INFO L158 Benchmark]: Toolchain (without parser) took 8854.72ms. Allocated memory was 157.3MB in the beginning and 243.3MB in the end (delta: 86.0MB). Free memory was 115.4MB in the beginning and 114.2MB in the end (delta: 1.1MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2024-11-08 16:49:56,315 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 96.5MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:49:56,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.80ms. Allocated memory is still 157.3MB. Free memory was 115.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 16:49:56,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.32ms. Allocated memory is still 157.3MB. Free memory was 94.4MB in the beginning and 90.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:49:56,316 INFO L158 Benchmark]: Boogie Preprocessor took 96.93ms. Allocated memory is still 157.3MB. Free memory was 90.2MB in the beginning and 86.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:49:56,317 INFO L158 Benchmark]: RCFGBuilder took 1069.60ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 85.6MB in the beginning and 143.8MB in the end (delta: -58.2MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-08 16:49:56,318 INFO L158 Benchmark]: TraceAbstraction took 7097.47ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 143.8MB in the beginning and 114.2MB in the end (delta: 29.5MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2024-11-08 16:49:56,318 INFO L158 Benchmark]: Witness Printer took 5.03ms. Allocated memory is still 243.3MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:49:56,320 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.23ms. Allocated memory is still 96.5MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.80ms. Allocated memory is still 157.3MB. Free memory was 115.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.32ms. Allocated memory is still 157.3MB. Free memory was 94.4MB in the beginning and 90.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.93ms. Allocated memory is still 157.3MB. Free memory was 90.2MB in the beginning and 86.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1069.60ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 85.6MB in the beginning and 143.8MB in the end (delta: -58.2MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7097.47ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 143.8MB in the beginning and 114.2MB in the end (delta: 29.5MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Witness Printer took 5.03ms. Allocated memory is still 243.3MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L63] signed long int last_1_WrapperStruct00_var_1_18 = -5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_18=-5] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] CALL updateLastVariables() [L141] EXPR WrapperStruct00.var_1_18 [L141] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L151] RET updateLastVariables() [L152] CALL updateVariables() [L98] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_2 [L99] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_2 [L99] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] 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, last_1_WrapperStruct00_var_1_18=-5] [L99] 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, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] 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, last_1_WrapperStruct00_var_1_18=-5] [L100] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] 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, last_1_WrapperStruct00_var_1_18=-5] [L101] 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, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] 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, last_1_WrapperStruct00_var_1_18=-5] [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_4 [L103] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_4 [L103] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L104] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_5 [L105] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_5 [L105] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L106] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L109] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L112] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L115] WrapperStruct00.var_1_13 = __VERIFIER_nondet_short() [L116] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L121] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L127] WrapperStruct00.var_1_17 = __VERIFIER_nondet_short() [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L130] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L131] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L133] WrapperStruct00.var_1_20 = __VERIFIER_nondet_long() [L134] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L136] WrapperStruct00.var_1_21 = __VERIFIER_nondet_long() [L137] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L137] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L137] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L152] RET updateVariables() [L153] CALL step() [L67] signed long int stepLocal_1 = last_1_WrapperStruct00_var_1_18; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_1=-5] [L68] COND FALSE !(stepLocal_1 >= 0) [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_15 [L71] EXPR WrapperStruct00.var_1_16 [L71] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L71] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))) [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L71] WrapperStruct00.var_1_12 = ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))) [L73] EXPR WrapperStruct00.var_1_15 [L73] EXPR WrapperStruct00.var_1_19 [L73] signed long int stepLocal_3 = WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19; [L74] EXPR WrapperStruct00.var_1_12 [L74] signed short int stepLocal_2 = WrapperStruct00.var_1_12; [L75] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=32757, stepLocal_3=32757] [L75] COND FALSE !(WrapperStruct00.var_1_12 > stepLocal_3) [L80] EXPR WrapperStruct00.var_1_14 [L80] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_14 [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=32757] [L82] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18) [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=32757] [L82] signed long int stepLocal_0 = (((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18)); [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR WrapperStruct00.var_1_4 [L83] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=32757, stepLocal_2=32757] [L83] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=32757, stepLocal_2=32757] [L83] COND TRUE (((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9 [L84] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=32757, stepLocal_2=32757] [L84] COND FALSE !(stepLocal_0 < WrapperStruct00.var_1_18) [L91] EXPR WrapperStruct00.var_1_10 [L91] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_10 [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR WrapperStruct00.var_1_2 [L144] EXPR WrapperStruct00.var_1_3 [L144] EXPR WrapperStruct00.var_1_4 [L144] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L144] EXPR WrapperStruct00.var_1_2 [L144] EXPR WrapperStruct00.var_1_3 [L144] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR ((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11)) [L144] EXPR WrapperStruct00.var_1_1 [L144] EXPR WrapperStruct00.var_1_11 [L144] EXPR ((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR (((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR ((((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))))))) && ((WrapperStruct00.var_1_12 > (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19)) ? ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_18 == ((signed long int) ((WrapperStruct00.var_1_17 + (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_20)) - WrapperStruct00.var_1_21))) : 1) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144-L145] return ((((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))))))) && ((WrapperStruct00.var_1_12 > (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19)) ? ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_18 == ((signed long int) ((WrapperStruct00.var_1_17 + (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_20)) - WrapperStruct00.var_1_21))) : 1) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_14))) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 1042 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 642 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 400 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 388 ConstructedInterpolants, 0 QuantifiedInterpolants, 435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2600/2600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:49:56,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX --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 fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:49:58,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:49:58,977 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:49:58,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:49:58,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:49:59,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:49:59,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:49:59,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:49:59,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:49:59,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:49:59,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:49:59,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:49:59,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:49:59,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:49:59,050 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:49:59,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:49:59,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:49:59,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:49:59,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:49:59,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:49:59,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:49:59,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:49:59,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:49:59,057 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:49:59,057 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:49:59,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:49:59,058 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:49:59,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:49:59,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:49:59,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:49:59,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:49:59,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:49:59,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:49:59,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:49:59,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:49:59,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:49:59,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:49:59,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:49:59,063 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:49:59,063 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:49:59,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:49:59,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:49:59,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:49:59,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:49:59,066 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_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/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_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX 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 -> fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f [2024-11-08 16:49:59,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:49:59,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:49:59,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:49:59,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:49:59,497 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:49:59,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i Unable to find full path for "g++" [2024-11-08 16:50:01,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:50:02,096 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:50:02,099 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2024-11-08 16:50:02,110 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/data/30252bb79/1b359da67bcf467098db58c5a1cdac76/FLAG0edc02ff1 [2024-11-08 16:50:02,130 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/data/30252bb79/1b359da67bcf467098db58c5a1cdac76 [2024-11-08 16:50:02,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:50:02,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:50:02,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:50:02,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:50:02,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:50:02,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:02,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798ca30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02, skipping insertion in model container [2024-11-08 16:50:02,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:02,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:50:02,482 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i[916,929] [2024-11-08 16:50:02,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:50:02,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:50:02,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i[916,929] [2024-11-08 16:50:02,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:50:02,916 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:50:02,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02 WrapperNode [2024-11-08 16:50:02,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:50:02,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:50:02,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:50:02,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:50:02,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:02,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,072 INFO L138 Inliner]: procedures = 37, calls = 208, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 584 [2024-11-08 16:50:03,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:50:03,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:50:03,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:50:03,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:50:03,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,136 INFO L175 MemorySlicer]: Split 171 memory accesses to 2 slices as follows [2, 169]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-08 16:50:03,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:50:03,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:50:03,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:50:03,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:50:03,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (1/1) ... [2024-11-08 16:50:03,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:50:03,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:50:03,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:50:03,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:50:03,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:50:03,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:50:03,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:50:03,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-08 16:50:03,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-08 16:50:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:50:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:50:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:50:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:50:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:50:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:50:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:50:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:50:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 16:50:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 16:50:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 16:50:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 16:50:03,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 16:50:03,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 16:50:03,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 16:50:03,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 16:50:03,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:50:03,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:50:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:50:03,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:50:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:50:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:50:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 16:50:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 16:50:03,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:50:03,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:50:03,583 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:50:03,587 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:50:13,470 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-11-08 16:50:13,473 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:50:13,501 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:50:13,504 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:50:13,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:13 BoogieIcfgContainer [2024-11-08 16:50:13,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:50:13,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:50:13,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:50:13,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:50:13,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:50:02" (1/3) ... [2024-11-08 16:50:13,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32522cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:50:13, skipping insertion in model container [2024-11-08 16:50:13,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:02" (2/3) ... [2024-11-08 16:50:13,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32522cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:50:13, skipping insertion in model container [2024-11-08 16:50:13,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:13" (3/3) ... [2024-11-08 16:50:13,519 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-50.i [2024-11-08 16:50:13,543 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:50:13,544 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:50:13,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:50:13,630 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f179734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:50:13,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:50:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 101 states have (on average 1.386138613861386) internal successors, (140), 102 states have internal predecessors, (140), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:50:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 16:50:13,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:13,658 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:13,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1193815482, now seen corresponding path program 1 times [2024-11-08 16:50:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:50:13,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79871169] [2024-11-08 16:50:13,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:13,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:50:13,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:50:13,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:50:13,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:50:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:14,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:50:14,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:50:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2024-11-08 16:50:14,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:50:14,954 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:50:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79871169] [2024-11-08 16:50:14,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79871169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:50:14,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:50:14,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:50:14,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369640212] [2024-11-08 16:50:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:14,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:50:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:50:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:50:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:50:15,017 INFO L87 Difference]: Start difference. First operand has 130 states, 101 states have (on average 1.386138613861386) internal successors, (140), 102 states have internal predecessors, (140), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:50:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:15,080 INFO L93 Difference]: Finished difference Result 253 states and 404 transitions. [2024-11-08 16:50:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:50:15,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-08 16:50:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:50:15,102 INFO L225 Difference]: With dead ends: 253 [2024-11-08 16:50:15,102 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 16:50:15,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:50:15,117 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:50:15,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:50:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 16:50:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-08 16:50:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:50:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-08 16:50:15,222 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 195 [2024-11-08 16:50:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:50:15,223 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-08 16:50:15,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:50:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-08 16:50:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 16:50:15,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:15,231 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:15,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 16:50:15,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:50:15,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:15,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1030083854, now seen corresponding path program 1 times [2024-11-08 16:50:15,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:50:15,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580040463] [2024-11-08 16:50:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:15,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:50:15,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:50:15,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:50:15,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:50:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:16,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:50:16,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:50:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 16:50:16,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:50:16,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:50:16,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580040463] [2024-11-08 16:50:16,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580040463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:50:16,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:50:16,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:50:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588143432] [2024-11-08 16:50:16,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:16,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:50:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:50:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:50:16,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:50:16,592 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:50:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:16,750 INFO L93 Difference]: Finished difference Result 251 states and 370 transitions. [2024-11-08 16:50:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:50:16,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-08 16:50:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:50:16,753 INFO L225 Difference]: With dead ends: 251 [2024-11-08 16:50:16,754 INFO L226 Difference]: Without dead ends: 128 [2024-11-08 16:50:16,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:50:16,757 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:50:16,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:50:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-08 16:50:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-08 16:50:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:50:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 187 transitions. [2024-11-08 16:50:16,777 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 187 transitions. Word has length 195 [2024-11-08 16:50:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:50:16,779 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 187 transitions. [2024-11-08 16:50:16,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:50:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 187 transitions. [2024-11-08 16:50:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 16:50:16,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:16,784 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:16,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 16:50:16,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:50:16,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:16,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -727543284, now seen corresponding path program 1 times [2024-11-08 16:50:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:50:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863167612] [2024-11-08 16:50:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:16,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:50:16,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:50:16,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:50:17,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:50:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:17,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:50:17,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:50:18,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:50:18,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 16:50:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-08 16:50:18,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:50:18,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:50:18,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863167612] [2024-11-08 16:50:18,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863167612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:50:18,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:50:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:50:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412391922] [2024-11-08 16:50:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:18,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:50:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:50:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:50:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:50:18,628 INFO L87 Difference]: Start difference. First operand 128 states and 187 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:50:21,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:24,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:27,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:29,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:29,678 INFO L93 Difference]: Finished difference Result 254 states and 372 transitions. [2024-11-08 16:50:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:50:29,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-08 16:50:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:50:29,686 INFO L225 Difference]: With dead ends: 254 [2024-11-08 16:50:29,686 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 16:50:29,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:50:29,690 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 164 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:50:29,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 514 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2024-11-08 16:50:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 16:50:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-08 16:50:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:50:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-08 16:50:29,711 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 195 [2024-11-08 16:50:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:50:29,712 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-08 16:50:29,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:50:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-08 16:50:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 16:50:29,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:29,717 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:29,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:50:29,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:50:29,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash -281281434, now seen corresponding path program 1 times [2024-11-08 16:50:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:50:29,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916418411] [2024-11-08 16:50:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:29,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:50:29,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:50:29,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:50:29,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:50:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:30,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:50:30,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:50:31,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:50:31,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 16:50:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2024-11-08 16:50:31,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:50:31,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:50:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916418411] [2024-11-08 16:50:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916418411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:50:31,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:50:31,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:50:31,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834768822] [2024-11-08 16:50:31,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:31,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:50:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:50:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:50:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:50:31,323 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:50:35,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:36,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:39,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:41,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:45,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:45,292 INFO L93 Difference]: Finished difference Result 254 states and 370 transitions. [2024-11-08 16:50:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:50:45,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 197 [2024-11-08 16:50:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:50:45,297 INFO L225 Difference]: With dead ends: 254 [2024-11-08 16:50:45,297 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 16:50:45,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:50:45,299 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 156 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:50:45,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 508 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2024-11-08 16:50:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 16:50:45,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-08 16:50:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.33) internal successors, (133), 100 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:50:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 185 transitions. [2024-11-08 16:50:45,315 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 185 transitions. Word has length 197 [2024-11-08 16:50:45,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:50:45,327 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 185 transitions. [2024-11-08 16:50:45,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 16:50:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 185 transitions. [2024-11-08 16:50:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 16:50:45,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:45,337 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:45,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 16:50:45,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:50:45,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:45,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash 153674060, now seen corresponding path program 1 times [2024-11-08 16:50:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:50:45,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990662882] [2024-11-08 16:50:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:45,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:50:45,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:50:45,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:50:45,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:50:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:47,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 16:50:47,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:50:47,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 16:50:47,215 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 [2024-11-08 16:50:47,329 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 [2024-11-08 16:50:47,451 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 [2024-11-08 16:50:47,568 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 [2024-11-08 16:50:47,688 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 [2024-11-08 16:50:47,806 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 [2024-11-08 16:50:47,924 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 [2024-11-08 16:50:48,048 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 [2024-11-08 16:50:48,223 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 27 treesize of output 26 [2024-11-08 16:50:48,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:50:48,385 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 44 treesize of output 49 [2024-11-08 16:50:48,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:50:48,692 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 59 treesize of output 61 [2024-11-08 16:50:49,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:50:49,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 99 treesize of output 45 [2024-11-08 16:50:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-11-08 16:50:49,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:50:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 16:50:49,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:50:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990662882] [2024-11-08 16:50:49,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990662882] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:50:49,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:50:49,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2024-11-08 16:50:49,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119293098] [2024-11-08 16:50:49,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:49,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:50:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:50:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:50:49,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:50:49,793 INFO L87 Difference]: Start difference. First operand 128 states and 185 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 16:50:51,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:53,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:55,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:57,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:59,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:51:02,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:51:05,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:51:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:05,928 INFO L93 Difference]: Finished difference Result 328 states and 472 transitions. [2024-11-08 16:51:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:51:05,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 199 [2024-11-08 16:51:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:51:05,934 INFO L225 Difference]: With dead ends: 328 [2024-11-08 16:51:05,935 INFO L226 Difference]: Without dead ends: 203 [2024-11-08 16:51:05,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:51:05,937 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 93 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:51:05,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 719 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2024-11-08 16:51:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-08 16:51:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2024-11-08 16:51:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 163 states have (on average 1.343558282208589) internal successors, (219), 164 states have internal predecessors, (219), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:51:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 287 transitions. [2024-11-08 16:51:05,983 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 287 transitions. Word has length 199 [2024-11-08 16:51:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:51:05,987 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 287 transitions. [2024-11-08 16:51:05,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 16:51:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 287 transitions. [2024-11-08 16:51:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 16:51:05,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:51:05,991 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:06,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 16:51:06,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:51:06,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:51:06,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1066643589, now seen corresponding path program 1 times [2024-11-08 16:51:06,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:51:06,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283136706] [2024-11-08 16:51:06,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:06,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:51:06,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:51:06,199 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:51:06,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:51:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:07,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 16:51:07,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:07,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 16:51:08,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 79 [2024-11-08 16:51:10,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:10,603 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 270 treesize of output 135 [2024-11-08 16:51:16,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:16,085 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 275 treesize of output 158 [2024-11-08 16:51:25,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:25,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 182 treesize of output 124 [2024-11-08 16:51:27,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:27,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 182 treesize of output 124 [2024-11-08 16:51:28,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:28,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 177 treesize of output 134 [2024-11-08 16:51:30,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:30,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 187 treesize of output 147 [2024-11-08 16:51:32,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:32,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 197 treesize of output 160 [2024-11-08 16:51:34,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:34,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 212 treesize of output 163 [2024-11-08 16:51:36,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:36,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 207 treesize of output 173 [2024-11-08 16:51:39,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:39,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 222 treesize of output 176 [2024-11-08 16:51:41,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:41,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 222 treesize of output 176 [2024-11-08 16:51:43,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:43,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 222 treesize of output 176 [2024-11-08 16:51:45,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:45,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 222 treesize of output 176 [2024-11-08 16:51:47,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:47,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 218 treesize of output 187 [2024-11-08 16:51:48,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:48,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 235 treesize of output 201 [2024-11-08 16:51:50,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:50,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 250 treesize of output 222 [2024-11-08 16:51:51,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:51,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 348 treesize of output 122 [2024-11-08 16:51:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 1048 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-08 16:51:57,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:51:57,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:51:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283136706] [2024-11-08 16:51:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283136706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:57,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:57,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 16:51:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625020154] [2024-11-08 16:51:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:57,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 16:51:57,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:51:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 16:51:57,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=302, Unknown=3, NotChecked=0, Total=420 [2024-11-08 16:51:57,685 INFO L87 Difference]: Start difference. First operand 200 states and 287 transitions. Second operand has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 8 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-11-08 16:51:58,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:00,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:01,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:03,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:04,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:06,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:52:07,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:16,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:20,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:32,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:37,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:41,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:45,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:49,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:53,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:52:57,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:01,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:05,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:09,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:13,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:17,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:21,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:25,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:30,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:34,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:38,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:42,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:46,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:50,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:54,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:58,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:02,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:21,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:22,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:24,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:27,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:30,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:34,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:36,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:40,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:44,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:46,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:48,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:56,770 WARN L286 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:54:58,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:09,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:12,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:15,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:17,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:21,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:25,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:28,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:31,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:55:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:55:33,006 INFO L93 Difference]: Finished difference Result 861 states and 1213 transitions. [2024-11-08 16:55:33,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 16:55:33,008 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 8 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 200 [2024-11-08 16:55:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:55:33,015 INFO L225 Difference]: With dead ends: 861 [2024-11-08 16:55:33,015 INFO L226 Difference]: Without dead ends: 664 [2024-11-08 16:55:33,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=141, Invalid=406, Unknown=5, NotChecked=0, Total=552 [2024-11-08 16:55:33,019 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 674 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 46 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 197.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 198.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:55:33,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 928 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2445 Invalid, 27 Unknown, 0 Unchecked, 198.7s Time] [2024-11-08 16:55:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-11-08 16:55:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 418. [2024-11-08 16:55:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 313 states have (on average 1.2747603833865815) internal successors, (399), 316 states have internal predecessors, (399), 93 states have call successors, (93), 11 states have call predecessors, (93), 11 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 16:55:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 585 transitions. [2024-11-08 16:55:33,110 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 585 transitions. Word has length 200 [2024-11-08 16:55:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:55:33,111 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 585 transitions. [2024-11-08 16:55:33,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 8 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-11-08 16:55:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 585 transitions. [2024-11-08 16:55:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 16:55:33,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:55:33,116 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:55:33,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 16:55:33,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:55:33,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:55:33,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:55:33,317 INFO L85 PathProgramCache]: Analyzing trace with hash 673616579, now seen corresponding path program 1 times [2024-11-08 16:55:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:55:33,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992768956] [2024-11-08 16:55:33,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:55:33,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:55:33,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:55:33,321 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:55:33,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d4809-8f5c-4c10-bdfa-f6fe52216df8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 16:55:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:55:34,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-08 16:55:34,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:55:35,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 16:55:35,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 59 [2024-11-08 16:55:37,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:55:37,430 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 255 treesize of output 117 [2024-11-08 16:55:41,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 193 [2024-11-08 16:55:51,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:55:51,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 479 treesize of output 247 [2024-11-08 16:55:54,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:55:54,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 464 treesize of output 256 [2024-11-08 16:55:58,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:55:58,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 464 treesize of output 256 [2024-11-08 16:56:00,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:00,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 464 treesize of output 256 [2024-11-08 16:56:04,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:04,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 459 treesize of output 266 [2024-11-08 16:56:08,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:08,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 389 treesize of output 235 [2024-11-08 16:56:12,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:12,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 404 treesize of output 238 [2024-11-08 16:56:16,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:16,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 404 treesize of output 238 [2024-11-08 16:56:19,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:19,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 404 treesize of output 238 [2024-11-08 16:56:22,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:22,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 404 treesize of output 238 [2024-11-08 16:56:25,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:25,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 404 treesize of output 238 [2024-11-08 16:56:29,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:29,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 400 treesize of output 249 [2024-11-08 16:56:31,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:31,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 417 treesize of output 263 [2024-11-08 16:56:34,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:34,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 432 treesize of output 284 [2024-11-08 16:56:37,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:56:37,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 727 treesize of output 243 [2024-11-08 16:57:33,444 WARN L286 SmtUtils]: Spent 20.51s on a formula simplification. DAG size of input: 56 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:57:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 132 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-08 16:57:33,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:57:41,692 WARN L286 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:59:10,153 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:03:56,614 WARN L286 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:04:31,736 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)