./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:47:25,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:47:25,174 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:47:25,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:47:25,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:47:25,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:47:25,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:47:25,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:47:25,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:47:25,215 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:47:25,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:47:25,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:47:25,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:47:25,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:47:25,217 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:47:25,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:47:25,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:47:25,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:47:25,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:47:25,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:47:25,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:47:25,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:47:25,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:47:25,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:47:25,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:47:25,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:47:25,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:47:25,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:47:25,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:47:25,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:47:25,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:47:25,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:47:25,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:47:25,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:47:25,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:47:25,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:47:25,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:47:25,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:47:25,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:47:25,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:47:25,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:47:25,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:47:25,234 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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2024-11-08 17:47:25,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:47:25,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:47:25,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:47:25,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:47:25,520 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:47:25,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i Unable to find full path for "g++" [2024-11-08 17:47:27,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:47:27,695 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:47:27,696 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-11-08 17:47:27,710 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/data/ea9865b91/138362cd3b1a4da9992d4cd365df7557/FLAGc1483aa2f [2024-11-08 17:47:27,726 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/data/ea9865b91/138362cd3b1a4da9992d4cd365df7557 [2024-11-08 17:47:27,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:47:27,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:47:27,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:47:27,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:47:27,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:47:27,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:47:27" (1/1) ... [2024-11-08 17:47:27,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636995d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:27, skipping insertion in model container [2024-11-08 17:47:27,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:47:27" (1/1) ... [2024-11-08 17:47:27,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:47:27,933 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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2024-11-08 17:47:28,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:47:28,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:47:28,030 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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2024-11-08 17:47:28,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:47:28,100 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:47:28,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28 WrapperNode [2024-11-08 17:47:28,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:47:28,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:47:28,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:47:28,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:47:28,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,168 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-08 17:47:28,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:47:28,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:47:28,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:47:28,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:47:28,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,208 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2024-11-08 17:47:28,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:47:28,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:47:28,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:47:28,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:47:28,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (1/1) ... [2024-11-08 17:47:28,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:47:28,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:47:28,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:47:28,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:47:28,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:47:28,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 17:47:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 17:47:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 17:47:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 17:47:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 17:47:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 17:47:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:47:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:47:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:47:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 17:47:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 17:47:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 17:47:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 17:47:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 17:47:28,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 17:47:28,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 17:47:28,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 17:47:28,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 17:47:28,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:47:28,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:47:28,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:47:28,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 17:47:28,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 17:47:28,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 17:47:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 17:47:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 17:47:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 17:47:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 17:47:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 17:47:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 17:47:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:47:28,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:47:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:47:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:47:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:47:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 17:47:28,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 17:47:28,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 17:47:28,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:47:28,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:47:28,470 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:47:28,473 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:47:29,061 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-08 17:47:29,062 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:47:29,085 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:47:29,086 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:47:29,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:47:29 BoogieIcfgContainer [2024-11-08 17:47:29,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:47:29,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:47:29,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:47:29,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:47:29,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:47:27" (1/3) ... [2024-11-08 17:47:29,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bf1b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:47:29, skipping insertion in model container [2024-11-08 17:47:29,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:28" (2/3) ... [2024-11-08 17:47:29,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bf1b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:47:29, skipping insertion in model container [2024-11-08 17:47:29,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:47:29" (3/3) ... [2024-11-08 17:47:29,096 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2024-11-08 17:47:29,114 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:47:29,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:47:29,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:47:29,190 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;@4d8dafed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:47:29,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:47:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:47:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:47:29,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:29,208 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:29,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:29,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1365355028, now seen corresponding path program 1 times [2024-11-08 17:47:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:29,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693258348] [2024-11-08 17:47:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:29,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:47:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:47:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:47:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:47:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:47:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:47:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:47:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:47:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:47:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:47:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:47:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:47:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:47:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:47:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:47:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:47:29,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693258348] [2024-11-08 17:47:29,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693258348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:29,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:29,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:47:29,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916105722] [2024-11-08 17:47:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:29,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:47:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:47:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:47:29,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:47:29,606 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:47:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:29,645 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-11-08 17:47:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:47:29,647 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-11-08 17:47:29,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:29,657 INFO L225 Difference]: With dead ends: 181 [2024-11-08 17:47:29,658 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 17:47:29,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:47:29,667 INFO L432 NwaCegarLoop]: 132 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, 132 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 17:47:29,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:47:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 17:47:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 17:47:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:47:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-11-08 17:47:29,722 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2024-11-08 17:47:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:29,723 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-11-08 17:47:29,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:47:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-11-08 17:47:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:47:29,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:29,728 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:29,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:47:29,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:29,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:29,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1687895930, now seen corresponding path program 1 times [2024-11-08 17:47:29,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:29,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008365752] [2024-11-08 17:47:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:29,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:47:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:47:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:47:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:47:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:47:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:47:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:47:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:47:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:47:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:47:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:47:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:47:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:47:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:47:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:47:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:30,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:47:30,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008365752] [2024-11-08 17:47:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008365752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:30,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:47:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875919394] [2024-11-08 17:47:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:30,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:47:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:47:30,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:47:30,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:47:30,360 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:30,425 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2024-11-08 17:47:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:47:30,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-08 17:47:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:30,430 INFO L225 Difference]: With dead ends: 179 [2024-11-08 17:47:30,430 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 17:47:30,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:47:30,432 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:30,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:47:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 17:47:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 17:47:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:47:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-08 17:47:30,454 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-11-08 17:47:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:30,457 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-08 17:47:30,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-08 17:47:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:47:30,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:30,462 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:30,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:47:30,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash -46726635, now seen corresponding path program 1 times [2024-11-08 17:47:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:30,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553016491] [2024-11-08 17:47:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:47:30,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813997894] [2024-11-08 17:47:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:30,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:47:30,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:47:30,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:47:30,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:47:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:31,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 17:47:31,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:47:31,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:31,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 19 [2024-11-08 17:47:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:31,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:47:31,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:47:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553016491] [2024-11-08 17:47:31,597 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 17:47:31,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813997894] [2024-11-08 17:47:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813997894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:31,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:47:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584871195] [2024-11-08 17:47:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:31,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:47:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:47:31,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:47:31,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:47:31,604 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:32,067 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2024-11-08 17:47:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:47:32,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 17:47:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:32,071 INFO L225 Difference]: With dead ends: 247 [2024-11-08 17:47:32,071 INFO L226 Difference]: Without dead ends: 158 [2024-11-08 17:47:32,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:47:32,073 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:32,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 755 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:47:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-08 17:47:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-11-08 17:47:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 131 states have internal predecessors, (181), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:47:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2024-11-08 17:47:32,094 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 121 [2024-11-08 17:47:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:32,095 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2024-11-08 17:47:32,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2024-11-08 17:47:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:47:32,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:32,098 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:32,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:47:32,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:47:32,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:32,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash -633532649, now seen corresponding path program 1 times [2024-11-08 17:47:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671177856] [2024-11-08 17:47:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:47:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:47:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:47:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:47:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:47:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:47:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:47:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:47:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:47:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:47:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:47:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:47:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:47:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:47:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:47:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:47:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671177856] [2024-11-08 17:47:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671177856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:47:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135922224] [2024-11-08 17:47:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:33,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:47:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:47:33,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:47:33,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:47:33,117 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:33,646 INFO L93 Difference]: Finished difference Result 447 states and 650 transitions. [2024-11-08 17:47:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:47:33,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 17:47:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:33,651 INFO L225 Difference]: With dead ends: 447 [2024-11-08 17:47:33,653 INFO L226 Difference]: Without dead ends: 295 [2024-11-08 17:47:33,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:47:33,655 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 201 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:33,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 644 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:47:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-08 17:47:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289. [2024-11-08 17:47:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 242 states have (on average 1.396694214876033) internal successors, (338), 245 states have internal predecessors, (338), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:47:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 422 transitions. [2024-11-08 17:47:33,683 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 422 transitions. Word has length 121 [2024-11-08 17:47:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:33,684 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 422 transitions. [2024-11-08 17:47:33,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 422 transitions. [2024-11-08 17:47:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:47:33,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:33,687 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:33,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:47:33,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:33,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1735670377, now seen corresponding path program 1 times [2024-11-08 17:47:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:33,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423063551] [2024-11-08 17:47:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:47:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:47:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:47:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:47:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:47:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:47:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:47:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:47:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:47:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:47:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:47:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:47:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:47:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:47:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:47:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:34,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:47:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423063551] [2024-11-08 17:47:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423063551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:34,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:34,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:47:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981205208] [2024-11-08 17:47:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:34,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:47:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:47:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:47:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:47:34,229 INFO L87 Difference]: Start difference. First operand 289 states and 422 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:34,585 INFO L93 Difference]: Finished difference Result 586 states and 849 transitions. [2024-11-08 17:47:34,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:47:34,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 17:47:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:34,588 INFO L225 Difference]: With dead ends: 586 [2024-11-08 17:47:34,588 INFO L226 Difference]: Without dead ends: 300 [2024-11-08 17:47:34,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:47:34,590 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 90 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:34,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 749 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:47:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-08 17:47:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 240. [2024-11-08 17:47:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 203 states have internal predecessors, (278), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 17:47:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 344 transitions. [2024-11-08 17:47:34,620 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 344 transitions. Word has length 121 [2024-11-08 17:47:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:34,620 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 344 transitions. [2024-11-08 17:47:34,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 344 transitions. [2024-11-08 17:47:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:47:34,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:34,623 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:34,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:47:34,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:34,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1972490905, now seen corresponding path program 1 times [2024-11-08 17:47:34,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:34,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633640311] [2024-11-08 17:47:34,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:34,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:47:34,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933466393] [2024-11-08 17:47:34,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:34,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:47:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:47:34,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:47:34,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:47:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:35,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 17:47:35,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:47:35,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 17:47:35,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:35,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 19 [2024-11-08 17:47:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:35,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:47:35,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:47:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633640311] [2024-11-08 17:47:35,366 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 17:47:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933466393] [2024-11-08 17:47:35,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933466393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:35,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:47:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188997190] [2024-11-08 17:47:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:35,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:47:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:47:35,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:47:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:47:35,370 INFO L87 Difference]: Start difference. First operand 240 states and 344 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:35,794 INFO L93 Difference]: Finished difference Result 591 states and 846 transitions. [2024-11-08 17:47:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:47:35,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 17:47:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:35,798 INFO L225 Difference]: With dead ends: 591 [2024-11-08 17:47:35,798 INFO L226 Difference]: Without dead ends: 354 [2024-11-08 17:47:35,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:47:35,800 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 77 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:35,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 956 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:47:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-08 17:47:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 301. [2024-11-08 17:47:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 254 states have (on average 1.3818897637795275) internal successors, (351), 257 states have internal predecessors, (351), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 17:47:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 431 transitions. [2024-11-08 17:47:35,849 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 431 transitions. Word has length 121 [2024-11-08 17:47:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:35,849 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 431 transitions. [2024-11-08 17:47:35,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 431 transitions. [2024-11-08 17:47:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:47:35,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:35,853 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:35,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 17:47:36,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 17:47:36,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:36,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1048393649, now seen corresponding path program 1 times [2024-11-08 17:47:36,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:36,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11381968] [2024-11-08 17:47:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:36,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:47:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:47:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:47:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:47:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:47:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:47:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:47:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:47:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:47:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:47:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:47:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:47:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:47:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:47:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:47:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:36,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:47:36,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11381968] [2024-11-08 17:47:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11381968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:36,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:36,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:47:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923575607] [2024-11-08 17:47:36,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:36,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:47:36,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:47:36,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:47:36,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:47:36,492 INFO L87 Difference]: Start difference. First operand 301 states and 431 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:36,684 INFO L93 Difference]: Finished difference Result 672 states and 958 transitions. [2024-11-08 17:47:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:47:36,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 17:47:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:36,688 INFO L225 Difference]: With dead ends: 672 [2024-11-08 17:47:36,688 INFO L226 Difference]: Without dead ends: 374 [2024-11-08 17:47:36,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:47:36,690 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 109 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:36,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 988 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:47:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-08 17:47:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 305. [2024-11-08 17:47:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 255 states have (on average 1.3725490196078431) internal successors, (350), 258 states have internal predecessors, (350), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:47:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 434 transitions. [2024-11-08 17:47:36,733 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 434 transitions. Word has length 122 [2024-11-08 17:47:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:36,733 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 434 transitions. [2024-11-08 17:47:36,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 434 transitions. [2024-11-08 17:47:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:47:36,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:36,736 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:36,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:47:36,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash 645572338, now seen corresponding path program 1 times [2024-11-08 17:47:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105708650] [2024-11-08 17:47:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:47:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:47:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:47:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:47:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:47:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:47:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:47:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:47:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:47:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:47:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:47:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:47:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:47:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:47:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:47:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:47:37,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105708650] [2024-11-08 17:47:37,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105708650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:37,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:37,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:47:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693048702] [2024-11-08 17:47:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:47:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:47:37,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:47:37,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:47:37,336 INFO L87 Difference]: Start difference. First operand 305 states and 434 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:37,519 INFO L93 Difference]: Finished difference Result 858 states and 1221 transitions. [2024-11-08 17:47:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:47:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 17:47:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:37,528 INFO L225 Difference]: With dead ends: 858 [2024-11-08 17:47:37,528 INFO L226 Difference]: Without dead ends: 556 [2024-11-08 17:47:37,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:47:37,530 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 76 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:37,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 674 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:47:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-08 17:47:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 550. [2024-11-08 17:47:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 476 states have (on average 1.3802521008403361) internal successors, (657), 483 states have internal predecessors, (657), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 17:47:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 781 transitions. [2024-11-08 17:47:37,626 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 781 transitions. Word has length 122 [2024-11-08 17:47:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:37,626 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 781 transitions. [2024-11-08 17:47:37,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 781 transitions. [2024-11-08 17:47:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:47:37,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:37,630 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:37,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:47:37,630 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:37,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2020991449, now seen corresponding path program 1 times [2024-11-08 17:47:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:37,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311889405] [2024-11-08 17:47:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:47:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:47:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:47:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:47:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:47:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:47:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:47:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:47:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:47:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:47:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:47:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:47:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:47:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:47:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:47:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:47:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311889405] [2024-11-08 17:47:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311889405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:38,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:47:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909234130] [2024-11-08 17:47:38,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:38,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:47:38,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:47:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:47:38,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:47:38,306 INFO L87 Difference]: Start difference. First operand 550 states and 781 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:38,510 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2024-11-08 17:47:38,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:47:38,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-08 17:47:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:38,514 INFO L225 Difference]: With dead ends: 1119 [2024-11-08 17:47:38,514 INFO L226 Difference]: Without dead ends: 572 [2024-11-08 17:47:38,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:47:38,516 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 75 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:38,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 814 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:47:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-08 17:47:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 554. [2024-11-08 17:47:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 480 states have (on average 1.3770833333333334) internal successors, (661), 487 states have internal predecessors, (661), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 17:47:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 785 transitions. [2024-11-08 17:47:38,579 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 785 transitions. Word has length 125 [2024-11-08 17:47:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:38,579 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 785 transitions. [2024-11-08 17:47:38,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 785 transitions. [2024-11-08 17:47:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:47:38,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:38,582 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:38,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:47:38,582 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:38,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1062462406, now seen corresponding path program 1 times [2024-11-08 17:47:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:47:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752192856] [2024-11-08 17:47:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:47:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:47:38,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696709375] [2024-11-08 17:47:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:38,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:47:38,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:47:38,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:47:38,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:47:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:47:39,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:47:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:47:40,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:47:40,979 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:47:40,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:47:40,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:47:41,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:47:41,185 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:41,323 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:47:41,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:47:41 BoogieIcfgContainer [2024-11-08 17:47:41,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:47:41,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:47:41,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:47:41,330 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:47:41,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:47:29" (3/4) ... [2024-11-08 17:47:41,333 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:47:41,334 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:47:41,335 INFO L158 Benchmark]: Toolchain (without parser) took 13605.99ms. Allocated memory was 151.0MB in the beginning and 281.0MB in the end (delta: 130.0MB). Free memory was 121.0MB in the beginning and 220.4MB in the end (delta: -99.4MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-11-08 17:47:41,335 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 102.8MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:47:41,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.19ms. Allocated memory is still 151.0MB. Free memory was 120.5MB in the beginning and 104.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:47:41,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.12ms. Allocated memory is still 151.0MB. Free memory was 103.7MB in the beginning and 100.0MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:47:41,337 INFO L158 Benchmark]: Boogie Preprocessor took 76.18ms. Allocated memory is still 151.0MB. Free memory was 100.0MB in the beginning and 95.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:47:41,337 INFO L158 Benchmark]: RCFGBuilder took 840.49ms. Allocated memory is still 151.0MB. Free memory was 95.3MB in the beginning and 112.0MB in the end (delta: -16.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 17:47:41,337 INFO L158 Benchmark]: TraceAbstraction took 12240.49ms. Allocated memory was 151.0MB in the beginning and 281.0MB in the end (delta: 130.0MB). Free memory was 111.2MB in the beginning and 220.4MB in the end (delta: -109.2MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-08 17:47:41,338 INFO L158 Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 281.0MB. Free memory is still 220.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:47:41,340 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.24ms. Allocated memory is still 102.8MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.19ms. Allocated memory is still 151.0MB. Free memory was 120.5MB in the beginning and 104.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.12ms. Allocated memory is still 151.0MB. Free memory was 103.7MB in the beginning and 100.0MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.18ms. Allocated memory is still 151.0MB. Free memory was 100.0MB in the beginning and 95.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 840.49ms. Allocated memory is still 151.0MB. Free memory was 95.3MB in the beginning and 112.0MB in the end (delta: -16.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12240.49ms. Allocated memory was 151.0MB in the beginning and 281.0MB in the end (delta: 130.0MB). Free memory was 111.2MB in the beginning and 220.4MB in the end (delta: -109.2MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 4.71ms. Allocated memory is still 281.0MB. Free memory is still 220.4MB. 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 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] double_Array_0[0] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L91] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L94] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L97] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L100] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR unsigned_long_int_Array_0[1][1] [L40] EXPR unsigned_long_int_Array_0[1][0] [L40] EXPR unsigned_long_int_Array_0[0][0] [L40] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L40] EXPR unsigned_long_int_Array_0[1][0] [L40] EXPR unsigned_long_int_Array_0[0][0] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] COND TRUE unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]))) [L41] EXPR signed_char_Array_0[0] [L41] signed_char_Array_0[1] = signed_char_Array_0[0] [L53] EXPR unsigned_long_int_Array_0[0][0] [L53] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0][0]; [L54] EXPR unsigned_long_int_Array_0[1][1] [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=-4294967293, unsigned_long_int_Array_0={8:0}] [L54] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))); [L55] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L55] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[0][0]) [L62] EXPR BOOL_unsigned_char_Array_0[0] [L62] unsigned char stepLocal_3 = BOOL_unsigned_char_Array_0[0]; [L63] EXPR signed_short_int_Array_0[0] [L63] EXPR signed_char_Array_0[1] [L63] signed long int stepLocal_2 = signed_short_int_Array_0[0] + signed_char_Array_0[1]; [L64] EXPR signed_char_Array_0[1] [L64] EXPR signed_char_Array_0[0] [L64] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] COND FALSE !(((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && stepLocal_3) [L75] EXPR double_Array_0[0] [L75] double_Array_0[1] = double_Array_0[0] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR unsigned_long_int_Array_0[0][0] [L106] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR unsigned_long_int_Array_0[0][0] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] [L106] EXPR BOOL_unsigned_char_Array_0[0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106-L107] return ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 713 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 713 mSDsluCounter, 6091 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4656 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1225 IncrementalHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1435 mSDtfsCounter, 1225 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=554occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 215 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1583 NumberOfCodeBlocks, 1583 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1082 ConstructedInterpolants, 0 QuantifiedInterpolants, 2317 SizeOfPredicates, 10 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3780/3780 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 17:47:41,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:47:43,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:47:43,889 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:47:43,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:47:43,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:47:43,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:47:43,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:47:43,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:47:43,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:47:43,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:47:43,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:47:43,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:47:43,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:47:43,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:47:43,946 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:47:43,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:47:43,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:47:43,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:47:43,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:47:43,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:47:43,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:47:43,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:47:43,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:47:43,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:47:43,953 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:47:43,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:47:43,954 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:47:43,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:47:43,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:47:43,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:47:43,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:47:43,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:47:43,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:47:43,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:47:43,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:47:43,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:47:43,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:47:43,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:47:43,958 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:47:43,959 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:47:43,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:47:43,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:47:43,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:47:43,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:47:43,960 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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2024-11-08 17:47:44,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:47:44,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:47:44,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:47:44,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:47:44,374 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:47:44,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i Unable to find full path for "g++" [2024-11-08 17:47:46,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:47:46,540 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:47:46,541 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-11-08 17:47:46,554 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/data/089da5a37/7330ce851e424b5a9a7a7f267c6fbe10/FLAG502ff1fd6 [2024-11-08 17:47:46,569 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/data/089da5a37/7330ce851e424b5a9a7a7f267c6fbe10 [2024-11-08 17:47:46,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:47:46,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:47:46,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:47:46,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:47:46,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:47:46,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:46,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3880da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46, skipping insertion in model container [2024-11-08 17:47:46,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:46,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:47:46,810 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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2024-11-08 17:47:46,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:47:46,898 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:47:46,909 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_93de3bbd-f9be-4573-bdde-ff69446e9bdf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i[916,929] [2024-11-08 17:47:46,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:47:46,981 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:47:46,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46 WrapperNode [2024-11-08 17:47:46,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:47:46,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:47:46,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:47:46,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:47:46,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,060 INFO L138 Inliner]: procedures = 36, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2024-11-08 17:47:47,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:47:47,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:47:47,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:47:47,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:47:47,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,105 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2024-11-08 17:47:47,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:47:47,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:47:47,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:47:47,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:47:47,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (1/1) ... [2024-11-08 17:47:47,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:47:47,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:47:47,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:47:47,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:47:47,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:47:47,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 17:47:47,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 17:47:47,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 17:47:47,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 17:47:47,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 17:47:47,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-08 17:47:47,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 17:47:47,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 17:47:47,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 17:47:47,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 17:47:47,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 17:47:47,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-08 17:47:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:47:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:47:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 17:47:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 17:47:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 17:47:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 17:47:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 17:47:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 17:47:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 17:47:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 17:47:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 17:47:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 17:47:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:47:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:47:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:47:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 17:47:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 17:47:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 17:47:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 17:47:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 17:47:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 17:47:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 17:47:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 17:47:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 17:47:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 17:47:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 17:47:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 17:47:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 17:47:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 17:47:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-08 17:47:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:47:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:47:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 17:47:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 17:47:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 17:47:47,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 17:47:47,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:47:47,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:47:47,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 17:47:47,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 17:47:47,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 17:47:47,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 17:47:47,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:47:47,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:47:47,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:47:47,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:47:47,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:47:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:47:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 17:47:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 17:47:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 17:47:47,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 17:47:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:47:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:47:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 17:47:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 17:47:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 17:47:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 17:47:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:47:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:47:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 17:47:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 17:47:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 17:47:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 17:47:47,452 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:47:47,454 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:47:48,279 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-08 17:47:48,279 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:47:48,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:47:48,299 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:47:48,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:47:48 BoogieIcfgContainer [2024-11-08 17:47:48,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:47:48,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:47:48,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:47:48,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:47:48,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:47:46" (1/3) ... [2024-11-08 17:47:48,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee940cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:47:48, skipping insertion in model container [2024-11-08 17:47:48,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:47:46" (2/3) ... [2024-11-08 17:47:48,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee940cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:47:48, skipping insertion in model container [2024-11-08 17:47:48,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:47:48" (3/3) ... [2024-11-08 17:47:48,313 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2024-11-08 17:47:48,332 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:47:48,333 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:47:48,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:47:48,423 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;@20dd7770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:47:48,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:47:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:47:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:47:48,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:48,446 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:48,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:48,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1365355028, now seen corresponding path program 1 times [2024-11-08 17:47:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:47:48,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173001808] [2024-11-08 17:47:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:48,472 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 17:47:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:47:48,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:48,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:48,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:47:48,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:47:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-08 17:47:48,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:47:48,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:47:48,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173001808] [2024-11-08 17:47:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173001808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:48,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:48,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:47:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552482623] [2024-11-08 17:47:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:48,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:47:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:47:48,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:47:48,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:47:48,984 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:47:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:49,014 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-11-08 17:47:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:47:49,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-11-08 17:47:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:49,025 INFO L225 Difference]: With dead ends: 181 [2024-11-08 17:47:49,025 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 17:47:49,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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 17:47:49,032 INFO L432 NwaCegarLoop]: 132 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, 132 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 17:47:49,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:47:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 17:47:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 17:47:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:47:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-11-08 17:47:49,077 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2024-11-08 17:47:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:49,078 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-11-08 17:47:49,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:47:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-11-08 17:47:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:47:49,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:49,083 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:49,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:49,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:49,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:49,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1687895930, now seen corresponding path program 1 times [2024-11-08 17:47:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:47:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21462461] [2024-11-08 17:47:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:49,290 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 17:47:49,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:47:49,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:49,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:49,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:47:49,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:47:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:49,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:47:49,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:47:49,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21462461] [2024-11-08 17:47:49,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21462461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:49,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:49,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:47:49,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885033468] [2024-11-08 17:47:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:49,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:47:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:47:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:47:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:47:49,737 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:49,812 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2024-11-08 17:47:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:47:49,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-08 17:47:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:49,815 INFO L225 Difference]: With dead ends: 179 [2024-11-08 17:47:49,815 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 17:47:49,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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 17:47:49,819 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:49,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:47:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 17:47:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 17:47:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:47:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-08 17:47:49,844 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-11-08 17:47:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:49,845 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-08 17:47:49,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-08 17:47:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:47:49,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:49,848 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:49,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:47:50,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:50,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:50,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash -46726635, now seen corresponding path program 1 times [2024-11-08 17:47:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:47:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674484855] [2024-11-08 17:47:50,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:50,051 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 17:47:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:47:50,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:50,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:50,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 17:47:50,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:47:51,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:51,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2024-11-08 17:47:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:51,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:47:51,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:47:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674484855] [2024-11-08 17:47:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674484855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:51,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:51,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:47:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260318615] [2024-11-08 17:47:51,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:51,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:47:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:47:51,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:47:51,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:47:51,539 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:53,621 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2024-11-08 17:47:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:47:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 17:47:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:53,627 INFO L225 Difference]: With dead ends: 247 [2024-11-08 17:47:53,627 INFO L226 Difference]: Without dead ends: 158 [2024-11-08 17:47:53,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:47:53,629 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:53,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 755 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:47:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-08 17:47:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-11-08 17:47:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 131 states have internal predecessors, (181), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:47:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2024-11-08 17:47:53,649 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 121 [2024-11-08 17:47:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:53,650 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2024-11-08 17:47:53,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2024-11-08 17:47:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:47:53,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:53,653 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:53,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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)] Ended with exit code 0 [2024-11-08 17:47:53,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:53,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:53,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash -633532649, now seen corresponding path program 1 times [2024-11-08 17:47:53,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:47:53,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711937454] [2024-11-08 17:47:53,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:53,855 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 17:47:53,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:47:53,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:53,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:54,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:47:54,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:47:54,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:54,359 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 34 treesize of output 10 [2024-11-08 17:47:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:54,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:47:54,391 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:47:54,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711937454] [2024-11-08 17:47:54,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711937454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:54,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:54,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:47:54,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358562810] [2024-11-08 17:47:54,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:54,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:47:54,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:47:54,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:47:54,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:47:54,398 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:54,910 INFO L93 Difference]: Finished difference Result 368 states and 534 transitions. [2024-11-08 17:47:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:47:54,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 17:47:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:54,915 INFO L225 Difference]: With dead ends: 368 [2024-11-08 17:47:54,915 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 17:47:54,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:47:54,918 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 92 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:54,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 484 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:47:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 17:47:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2024-11-08 17:47:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 180 states have internal predecessors, (246), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 17:47:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2024-11-08 17:47:54,956 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 121 [2024-11-08 17:47:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:54,958 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2024-11-08 17:47:54,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2024-11-08 17:47:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:47:54,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:54,969 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:54,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:47:55,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:55,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:55,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1735670377, now seen corresponding path program 1 times [2024-11-08 17:47:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:47:55,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700310070] [2024-11-08 17:47:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:55,171 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 17:47:55,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:47:55,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:55,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:55,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:47:55,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:47:55,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:55,600 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 35 treesize of output 11 [2024-11-08 17:47:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:55,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:47:55,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:47:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700310070] [2024-11-08 17:47:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700310070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:55,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:47:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824785752] [2024-11-08 17:47:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:55,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:47:55,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:47:55,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:47:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:47:55,619 INFO L87 Difference]: Start difference. First operand 213 states and 308 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:56,253 INFO L93 Difference]: Finished difference Result 430 states and 618 transitions. [2024-11-08 17:47:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:47:56,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 17:47:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:56,256 INFO L225 Difference]: With dead ends: 430 [2024-11-08 17:47:56,257 INFO L226 Difference]: Without dead ends: 220 [2024-11-08 17:47:56,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:47:56,259 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 90 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:56,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 612 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:47:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-08 17:47:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 160. [2024-11-08 17:47:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 134 states have (on average 1.373134328358209) internal successors, (184), 135 states have internal predecessors, (184), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:47:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 228 transitions. [2024-11-08 17:47:56,274 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 228 transitions. Word has length 121 [2024-11-08 17:47:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:56,275 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 228 transitions. [2024-11-08 17:47:56,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 228 transitions. [2024-11-08 17:47:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:47:56,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:56,278 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:56,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:56,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:56,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:56,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1972490905, now seen corresponding path program 1 times [2024-11-08 17:47:56,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:47:56,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832066282] [2024-11-08 17:47:56,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:56,480 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 17:47:56,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:47:56,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:56,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:47:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:56,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 17:47:56,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:47:57,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:57,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2024-11-08 17:47:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:47:57,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:47:57,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:47:57,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832066282] [2024-11-08 17:47:57,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832066282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:57,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:47:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649444020] [2024-11-08 17:47:57,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:57,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:47:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:47:57,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:47:57,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:47:57,861 INFO L87 Difference]: Start difference. First operand 160 states and 228 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:59,952 INFO L93 Difference]: Finished difference Result 375 states and 534 transitions. [2024-11-08 17:47:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:47:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-08 17:47:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:59,958 INFO L225 Difference]: With dead ends: 375 [2024-11-08 17:47:59,958 INFO L226 Difference]: Without dead ends: 218 [2024-11-08 17:47:59,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:47:59,959 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 78 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:59,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1014 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:47:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-08 17:47:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 166. [2024-11-08 17:47:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 141 states have internal predecessors, (193), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:47:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2024-11-08 17:47:59,973 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 121 [2024-11-08 17:47:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:59,973 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2024-11-08 17:47:59,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:47:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2024-11-08 17:47:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:47:59,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:59,976 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:47:59,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:48:00,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:48:00,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:00,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:00,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1048393649, now seen corresponding path program 1 times [2024-11-08 17:48:00,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:48:00,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205327499] [2024-11-08 17:48:00,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:00,178 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 17:48:00,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:48:00,181 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:48:00,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:48:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:00,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:48:00,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:48:00,476 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 20 treesize of output 16 [2024-11-08 17:48:00,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2024-11-08 17:48:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:48:00,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:48:00,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:48:00,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205327499] [2024-11-08 17:48:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205327499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:00,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:00,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:48:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299109075] [2024-11-08 17:48:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:00,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:48:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:48:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:48:00,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:48:00,609 INFO L87 Difference]: Start difference. First operand 166 states and 237 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:48:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:48:01,005 INFO L93 Difference]: Finished difference Result 382 states and 544 transitions. [2024-11-08 17:48:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:48:01,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 17:48:01,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:48:01,008 INFO L225 Difference]: With dead ends: 382 [2024-11-08 17:48:01,008 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 17:48:01,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:48:01,009 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 109 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:48:01,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 988 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:48:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 17:48:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 164. [2024-11-08 17:48:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 139 states have internal predecessors, (190), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:48:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 234 transitions. [2024-11-08 17:48:01,024 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 234 transitions. Word has length 122 [2024-11-08 17:48:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:48:01,025 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 234 transitions. [2024-11-08 17:48:01,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:48:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 234 transitions. [2024-11-08 17:48:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:48:01,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:01,027 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:48:01,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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)] Ended with exit code 0 [2024-11-08 17:48:01,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:48:01,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:01,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 645572338, now seen corresponding path program 1 times [2024-11-08 17:48:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:48:01,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502729746] [2024-11-08 17:48:01,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:01,229 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 17:48:01,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:48:01,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:48:01,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 (9)] Waiting until timeout for monitored process [2024-11-08 17:48:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:48:01,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 17:48:01,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:48:01,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 17:48:01,669 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 19 treesize of output 19 [2024-11-08 17:48:01,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:01,767 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 60 treesize of output 30 [2024-11-08 17:48:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:48:01,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:48:01,816 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:48:01,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502729746] [2024-11-08 17:48:01,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502729746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:01,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:01,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:48:01,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280721552] [2024-11-08 17:48:01,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:01,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:48:01,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:48:01,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:48:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:48:01,819 INFO L87 Difference]: Start difference. First operand 164 states and 234 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:48:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:48:02,166 INFO L93 Difference]: Finished difference Result 459 states and 655 transitions. [2024-11-08 17:48:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:48:02,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-08 17:48:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:48:02,169 INFO L225 Difference]: With dead ends: 459 [2024-11-08 17:48:02,169 INFO L226 Difference]: Without dead ends: 298 [2024-11-08 17:48:02,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:48:02,170 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 76 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:48:02,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 674 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:48:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-08 17:48:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2024-11-08 17:48:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.38671875) internal successors, (355), 259 states have internal predecessors, (355), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 17:48:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 419 transitions. [2024-11-08 17:48:02,190 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 419 transitions. Word has length 122 [2024-11-08 17:48:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:48:02,190 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 419 transitions. [2024-11-08 17:48:02,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:48:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 419 transitions. [2024-11-08 17:48:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:48:02,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:48:02,193 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:48:02,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 (9)] Ended with exit code 0 [2024-11-08 17:48:02,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:48:02,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:48:02,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:48:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2020991449, now seen corresponding path program 1 times [2024-11-08 17:48:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:48:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167562040] [2024-11-08 17:48:02,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:48:02,395 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 17:48:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:48:02,398 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 17:48:02,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93de3bbd-f9be-4573-bdde-ff69446e9bdf/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 (10)] Waiting until timeout for monitored process