./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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_eed38fbc-4f08-4327-8810-f229a13e9557/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 c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:24:17,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:24:17,941 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:24:17,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:24:17,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:24:17,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:24:17,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:24:17,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:24:17,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:24:17,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:24:17,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:24:17,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:24:17,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:24:17,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:24:17,982 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:24:17,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:24:17,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:24:17,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:24:17,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:24:17,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:24:17,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:24:17,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:24:17,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:24:17,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:24:17,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:24:17,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:24:17,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:24:17,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:24:17,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:24:17,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:24:17,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:24:17,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:24:17,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:24:18,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:24:18,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:24:18,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:24:18,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:24:18,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:24:18,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:24:18,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:24:18,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:24:18,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:24:18,017 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_eed38fbc-4f08-4327-8810-f229a13e9557/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_eed38fbc-4f08-4327-8810-f229a13e9557/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 -> c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e [2024-11-08 16:24:18,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:24:18,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:24:18,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:24:18,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:24:18,417 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:24:18,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i Unable to find full path for "g++" [2024-11-08 16:24:20,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:24:21,085 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:24:21,085 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i [2024-11-08 16:24:21,101 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/data/dd6ae98fe/4e6240d756774491bb51e542e3652111/FLAG7105756bc [2024-11-08 16:24:21,327 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/data/dd6ae98fe/4e6240d756774491bb51e542e3652111 [2024-11-08 16:24:21,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:24:21,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:24:21,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:24:21,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:24:21,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:24:21,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:21,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2242cf22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21, skipping insertion in model container [2024-11-08 16:24:21,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:21,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:24:21,649 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_eed38fbc-4f08-4327-8810-f229a13e9557/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2024-11-08 16:24:21,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:24:21,774 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:24:21,793 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_eed38fbc-4f08-4327-8810-f229a13e9557/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2024-11-08 16:24:21,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:24:21,890 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:24:21,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21 WrapperNode [2024-11-08 16:24:21,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:24:21,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:24:21,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:24:21,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:24:21,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:21,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:21,992 INFO L138 Inliner]: procedures = 29, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2024-11-08 16:24:21,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:24:21,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:24:21,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:24:21,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:24:22,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,055 INFO L175 MemorySlicer]: Split 141 memory accesses to 6 slices as follows [2, 22, 18, 39, 13, 47]. 33 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 4]. The 17 writes are split as follows [0, 3, 2, 4, 3, 5]. [2024-11-08 16:24:22,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,085 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:24:22,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:24:22,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:24:22,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:24:22,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (1/1) ... [2024-11-08 16:24:22,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:24:22,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:24:22,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:24:22,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:24:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:24:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 16:24:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 16:24:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 16:24:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 16:24:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 16:24:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 16:24:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 16:24:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 16:24:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 16:24:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 16:24:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 16:24:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 16:24:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 16:24:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 16:24:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 16:24:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 16:24:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 16:24:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 16:24:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 16:24:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 16:24:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 16:24:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 16:24:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 16:24:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 16:24:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 16:24:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 16:24:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 16:24:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 16:24:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 16:24:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 16:24:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:24:22,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:24:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:24:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:24:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 16:24:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 16:24:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 16:24:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 16:24:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:24:22,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:24:22,516 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:24:22,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:24:23,588 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-08 16:24:23,589 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:24:23,619 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:24:23,622 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:24:23,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:23 BoogieIcfgContainer [2024-11-08 16:24:23,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:24:23,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:24:23,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:24:23,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:24:23,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:24:21" (1/3) ... [2024-11-08 16:24:23,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3031001f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:24:23, skipping insertion in model container [2024-11-08 16:24:23,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:21" (2/3) ... [2024-11-08 16:24:23,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3031001f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:24:23, skipping insertion in model container [2024-11-08 16:24:23,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:23" (3/3) ... [2024-11-08 16:24:23,638 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-11.i [2024-11-08 16:24:23,666 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:24:23,666 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:24:23,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:24:23,796 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;@3884d5ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:24:23,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:24:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:24:23,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:23,828 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:23,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:23,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash -950577258, now seen corresponding path program 1 times [2024-11-08 16:24:23,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:23,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340042838] [2024-11-08 16:24:23,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:23,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:24:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:24:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:24:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:24:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:24:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:24:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:24:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:24:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:24:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:24:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:24:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:24:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:24:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:24:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:24:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:24:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:24:24,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:24,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340042838] [2024-11-08 16:24:24,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340042838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:24,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:24,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:24:24,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641214447] [2024-11-08 16:24:24,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:24,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:24:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:24,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:24:24,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:24:24,585 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:24:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:24:24,655 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-11-08 16:24:24,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:24:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-08 16:24:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:24:24,675 INFO L225 Difference]: With dead ends: 271 [2024-11-08 16:24:24,675 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 16:24:24,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:24:24,690 INFO L432 NwaCegarLoop]: 201 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, 201 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:24:24,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:24:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 16:24:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-08 16:24:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-11-08 16:24:24,785 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-11-08 16:24:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:24:24,790 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-11-08 16:24:24,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:24:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-11-08 16:24:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:24:24,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:24,799 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:24,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:24:24,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:24,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:24,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1510452990, now seen corresponding path program 1 times [2024-11-08 16:24:24,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:24,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967632250] [2024-11-08 16:24:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:24,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:24:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:24:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:24:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:24:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:24:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:24:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:24:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:24:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:24:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:24:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:24:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:24:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:24:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:24:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:24:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:24:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:24:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967632250] [2024-11-08 16:24:25,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967632250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:25,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:25,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:24:25,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858612021] [2024-11-08 16:24:25,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:24:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:24:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:24:25,586 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:24:25,675 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2024-11-08 16:24:25,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:24:25,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-08 16:24:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:24:25,678 INFO L225 Difference]: With dead ends: 269 [2024-11-08 16:24:25,679 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 16:24:25,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:24:25,686 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 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 16:24:25,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:24:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 16:24:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-08 16:24:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-11-08 16:24:25,708 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2024-11-08 16:24:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:24:25,710 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-11-08 16:24:25,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-11-08 16:24:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 16:24:25,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:25,715 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:25,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:24:25,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:25,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -276470206, now seen corresponding path program 1 times [2024-11-08 16:24:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:25,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499221623] [2024-11-08 16:24:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:24:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:24:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:24:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:24:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:24:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:24:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:24:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:24:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:24:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:24:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:24:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:24:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:24:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:24:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:24:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:24:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:24:26,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:26,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499221623] [2024-11-08 16:24:26,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499221623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:26,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:26,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:24:26,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392852750] [2024-11-08 16:24:26,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:26,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:24:26,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:24:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:24:26,248 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:24:26,350 INFO L93 Difference]: Finished difference Result 274 states and 407 transitions. [2024-11-08 16:24:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:24:26,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-08 16:24:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:24:26,357 INFO L225 Difference]: With dead ends: 274 [2024-11-08 16:24:26,361 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 16:24:26,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:24:26,363 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:24:26,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:24:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 16:24:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-08 16:24:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 122 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2024-11-08 16:24:26,386 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 135 [2024-11-08 16:24:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:24:26,387 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2024-11-08 16:24:26,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2024-11-08 16:24:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 16:24:26,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:26,391 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:26,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:24:26,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:26,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1323516005, now seen corresponding path program 1 times [2024-11-08 16:24:26,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:26,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34019917] [2024-11-08 16:24:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:26,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:24:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:24:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:24:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:24:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:24:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:24:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:24:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:24:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:24:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:24:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:24:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:24:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:24:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:24:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:24:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:24:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:24:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34019917] [2024-11-08 16:24:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34019917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:26,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:26,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:24:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821573778] [2024-11-08 16:24:26,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:26,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:24:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:26,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:24:26,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:24:26,715 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:24:26,778 INFO L93 Difference]: Finished difference Result 280 states and 413 transitions. [2024-11-08 16:24:26,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:24:26,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-08 16:24:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:24:26,781 INFO L225 Difference]: With dead ends: 280 [2024-11-08 16:24:26,781 INFO L226 Difference]: Without dead ends: 143 [2024-11-08 16:24:26,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:24:26,783 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:24:26,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:24:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-08 16:24:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-08 16:24:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-11-08 16:24:26,796 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 136 [2024-11-08 16:24:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:24:26,797 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-11-08 16:24:26,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-11-08 16:24:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:24:26,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:26,801 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:26,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:24:26,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:26,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2019188951, now seen corresponding path program 1 times [2024-11-08 16:24:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:26,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955672281] [2024-11-08 16:24:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:24:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:24:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:24:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:24:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:24:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:24:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:24:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:24:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:24:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:24:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:24:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:24:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:24:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:24:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:24:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:24:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:24:27,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:27,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955672281] [2024-11-08 16:24:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955672281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:27,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:27,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:24:27,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133618345] [2024-11-08 16:24:27,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:27,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:24:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:27,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:24:27,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:24:27,238 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:24:27,320 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2024-11-08 16:24:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:24:27,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-08 16:24:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:24:27,325 INFO L225 Difference]: With dead ends: 283 [2024-11-08 16:24:27,325 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 16:24:27,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:24:27,328 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:24:27,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 964 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:24:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 16:24:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-11-08 16:24:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 124 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-11-08 16:24:27,342 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 137 [2024-11-08 16:24:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:24:27,345 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-11-08 16:24:27,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-11-08 16:24:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:24:27,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:27,353 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:24:27,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:27,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash 54274420, now seen corresponding path program 1 times [2024-11-08 16:24:27,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:27,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416782755] [2024-11-08 16:24:27,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:24:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:24:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:24:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:24:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:24:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:24:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:24:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:24:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:24:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:24:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:24:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:24:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:24:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:24:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:24:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:24:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:24:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:27,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416782755] [2024-11-08 16:24:27,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416782755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:27,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:24:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517779370] [2024-11-08 16:24:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:27,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:24:27,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:24:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:24:27,757 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:24:27,822 INFO L93 Difference]: Finished difference Result 284 states and 417 transitions. [2024-11-08 16:24:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:24:27,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-08 16:24:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:24:27,825 INFO L225 Difference]: With dead ends: 284 [2024-11-08 16:24:27,825 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 16:24:27,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:24:27,829 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:24:27,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:24:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 16:24:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-08 16:24:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 127 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2024-11-08 16:24:27,855 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 137 [2024-11-08 16:24:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:24:27,856 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2024-11-08 16:24:27,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2024-11-08 16:24:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 16:24:27,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:27,862 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:27,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:24:27,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:27,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1068696692, now seen corresponding path program 1 times [2024-11-08 16:24:27,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:27,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349430439] [2024-11-08 16:24:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:24:28,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:24:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:24:28,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:24:28,165 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:24:28,166 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:24:28,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:24:28,174 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:28,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:24:28,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:24:28 BoogieIcfgContainer [2024-11-08 16:24:28,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:24:28,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:24:28,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:24:28,337 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:24:28,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:23" (3/4) ... [2024-11-08 16:24:28,341 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:24:28,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:24:28,344 INFO L158 Benchmark]: Toolchain (without parser) took 7011.74ms. Allocated memory was 144.7MB in the beginning and 190.8MB in the end (delta: 46.1MB). Free memory was 111.9MB in the beginning and 50.4MB in the end (delta: 61.4MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. [2024-11-08 16:24:28,344 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 144.7MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:24:28,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.67ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 94.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 16:24:28,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.20ms. Allocated memory is still 144.7MB. Free memory was 94.0MB in the beginning and 89.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:24:28,346 INFO L158 Benchmark]: Boogie Preprocessor took 132.34ms. Allocated memory is still 144.7MB. Free memory was 89.5MB in the beginning and 83.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 16:24:28,346 INFO L158 Benchmark]: RCFGBuilder took 1495.81ms. Allocated memory was 144.7MB in the beginning and 190.8MB in the end (delta: 46.1MB). Free memory was 83.6MB in the beginning and 148.0MB in the end (delta: -64.3MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-11-08 16:24:28,347 INFO L158 Benchmark]: TraceAbstraction took 4707.62ms. Allocated memory is still 190.8MB. Free memory was 148.0MB in the beginning and 50.4MB in the end (delta: 97.6MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2024-11-08 16:24:28,347 INFO L158 Benchmark]: Witness Printer took 6.62ms. Allocated memory is still 190.8MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:24:28,349 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.40ms. Allocated memory is still 144.7MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.67ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 94.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.20ms. Allocated memory is still 144.7MB. Free memory was 94.0MB in the beginning and 89.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.34ms. Allocated memory is still 144.7MB. Free memory was 89.5MB in the beginning and 83.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1495.81ms. Allocated memory was 144.7MB in the beginning and 190.8MB in the end (delta: 46.1MB). Free memory was 83.6MB in the beginning and 148.0MB in the end (delta: -64.3MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4707.62ms. Allocated memory is still 190.8MB. Free memory was 148.0MB in the beginning and 50.4MB in the end (delta: 97.6MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. * Witness Printer took 6.62ms. Allocated memory is still 190.8MB. Free memory is still 50.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 101, overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 1 }; [L25-L27] double double_Array_0[2] = { 7.675, 50.75 }; [L25-L27] double double_Array_0[2] = { 7.675, 50.75 }; [L25-L27] double double_Array_0[2] = { 7.675, 50.75 }; [L28-L30] float float_Array_0[3] = { 1000000.7, 32.5, 2.4 }; [L28-L30] float float_Array_0[3] = { 1000000.7, 32.5, 2.4 }; [L28-L30] float float_Array_0[3] = { 1000000.7, 32.5, 2.4 }; [L28-L30] float float_Array_0[3] = { 1000000.7, 32.5, 2.4 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -16 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -16 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -16 }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L37] unsigned char last_1_BOOL_unsigned_char_Array_0_2_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR BOOL_unsigned_char_Array_0[2] [L98] last_1_BOOL_unsigned_char_Array_0_2_ = BOOL_unsigned_char_Array_0[2] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] double_Array_0[0] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[0] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L77] EXPR double_Array_0[0] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] double_Array_0[1] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[1] [L79] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L79] EXPR double_Array_0[1] [L79] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] float_Array_0[0] = __VERIFIER_nondet_float() [L81] EXPR float_Array_0[0] [L81] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L81] EXPR float_Array_0[0] [L81] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] float_Array_0[2] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[2] [L83] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F [L83] EXPR float_Array_0[2] [L83] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] CALL assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] RET assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L109] RET updateVariables() [L110] CALL step() [L41] EXPR double_Array_0[0] [L41] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L41] COND FALSE !(double_Array_0[0] >= double_Array_0[1]) [L50] EXPR float_Array_0[1] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L50] COND FALSE !(float_Array_0[1] <= float_Array_0[1]) [L53] EXPR BOOL_unsigned_char_Array_0[2] [L53] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[2]; [L54] EXPR double_Array_0[1] [L54] EXPR float_Array_0[1] [L54] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L54] COND FALSE !((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) [L63] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L63] COND FALSE !(! BOOL_unsigned_char_Array_0[2]) [L66] EXPR unsigned_char_Array_0[0][0] [L66] unsigned_char_Array_0[0][1] = unsigned_char_Array_0[0][0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR double_Array_0[1] [L101] EXPR float_Array_0[1] [L101] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR ((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1 [L101] EXPR BOOL_unsigned_char_Array_0[2] [L101] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2] [L101] EXPR BOOL_unsigned_char_Array_0[2] [L101] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1 [L101] EXPR float_Array_0[1] [L101] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) [L101] EXPR signed_char_Array_0[1] [L101] EXPR signed_char_Array_0[0] [L101] EXPR (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR ((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR ((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR ((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)) && ((! BOOL_unsigned_char_Array_0[2]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((((((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) < (unsigned_char_Array_0[1][0])) ? (((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) : (unsigned_char_Array_0[1][0]))))) : (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)) && ((! BOOL_unsigned_char_Array_0[2]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((((((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) < (unsigned_char_Array_0[1][0])) ? (((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) : (unsigned_char_Array_0[1][0]))))) : (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101-L102] return (((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)) && ((! BOOL_unsigned_char_Array_0[2]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((((((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) < (unsigned_char_Array_0[1][0])) ? (((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) : (unsigned_char_Array_0[1][0]))))) : (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 4079 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2888 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1191 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 805 ConstructedInterpolants, 0 QuantifiedInterpolants, 826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:24:28,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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_eed38fbc-4f08-4327-8810-f229a13e9557/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 c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:24:31,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:24:31,410 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:24:31,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:24:31,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:24:31,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:24:31,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:24:31,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:24:31,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:24:31,459 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:24:31,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:24:31,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:24:31,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:24:31,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:24:31,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:24:31,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:24:31,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:24:31,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:24:31,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:24:31,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:24:31,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:24:31,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:24:31,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:24:31,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:24:31,470 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:24:31,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:24:31,471 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:24:31,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:24:31,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:24:31,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:24:31,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:24:31,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:24:31,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:24:31,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:24:31,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:24:31,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:24:31,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:24:31,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:24:31,479 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:24:31,480 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:24:31,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:24:31,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:24:31,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:24:31,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:24:31,484 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_eed38fbc-4f08-4327-8810-f229a13e9557/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_eed38fbc-4f08-4327-8810-f229a13e9557/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 -> c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e [2024-11-08 16:24:31,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:24:32,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:24:32,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:24:32,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:24:32,028 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:24:32,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i Unable to find full path for "g++" [2024-11-08 16:24:34,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:24:35,288 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:24:35,288 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i [2024-11-08 16:24:35,303 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/data/738a60a36/ecbd702a3faa48c0aaf91f3acee983e1/FLAG645537208 [2024-11-08 16:24:35,490 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/data/738a60a36/ecbd702a3faa48c0aaf91f3acee983e1 [2024-11-08 16:24:35,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:24:35,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:24:35,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:24:35,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:24:35,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:24:35,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:24:35" (1/1) ... [2024-11-08 16:24:35,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3432f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:35, skipping insertion in model container [2024-11-08 16:24:35,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:24:35" (1/1) ... [2024-11-08 16:24:35,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:24:35,780 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_eed38fbc-4f08-4327-8810-f229a13e9557/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2024-11-08 16:24:35,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:24:35,891 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:24:35,908 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_eed38fbc-4f08-4327-8810-f229a13e9557/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2024-11-08 16:24:35,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:24:36,009 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:24:36,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36 WrapperNode [2024-11-08 16:24:36,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:24:36,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:24:36,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:24:36,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:24:36,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,193 INFO L138 Inliner]: procedures = 33, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 585 [2024-11-08 16:24:36,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:24:36,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:24:36,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:24:36,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:24:36,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,245 INFO L175 MemorySlicer]: Split 141 memory accesses to 6 slices as follows [2, 22, 18, 39, 13, 47]. 33 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 4]. The 17 writes are split as follows [0, 3, 2, 4, 3, 5]. [2024-11-08 16:24:36,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:24:36,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:24:36,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:24:36,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:24:36,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (1/1) ... [2024-11-08 16:24:36,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:24:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:24:36,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:24:36,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:24:36,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:24:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:24:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:24:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 16:24:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 16:24:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 16:24:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-08 16:24:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:24:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:24:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 16:24:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 16:24:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 16:24:36,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-08 16:24:36,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:24:36,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:24:36,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 16:24:36,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 16:24:36,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 16:24:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 16:24:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:24:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:24:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 16:24:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 16:24:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 16:24:36,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 16:24:36,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 16:24:36,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 16:24:36,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 16:24:36,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 16:24:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-08 16:24:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-08 16:24:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 16:24:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 16:24:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 16:24:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 16:24:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 16:24:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-08 16:24:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 16:24:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 16:24:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 16:24:36,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 16:24:36,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-08 16:24:36,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-08 16:24:36,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 16:24:36,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 16:24:36,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 16:24:36,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 16:24:36,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-08 16:24:36,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-08 16:24:36,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:24:36,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:24:36,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:24:36,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:24:36,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:24:36,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:24:36,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 16:24:36,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 16:24:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 16:24:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 16:24:36,699 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:24:36,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:24:55,625 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live. [2024-11-08 16:24:55,626 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:24:55,645 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:24:55,645 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:24:55,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:55 BoogieIcfgContainer [2024-11-08 16:24:55,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:24:55,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:24:55,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:24:55,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:24:55,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:24:35" (1/3) ... [2024-11-08 16:24:55,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba78133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:24:55, skipping insertion in model container [2024-11-08 16:24:55,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:36" (2/3) ... [2024-11-08 16:24:55,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba78133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:24:55, skipping insertion in model container [2024-11-08 16:24:55,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:55" (3/3) ... [2024-11-08 16:24:55,658 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-11.i [2024-11-08 16:24:55,682 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:24:55,682 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:24:55,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:24:55,773 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;@70ea1bfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:24:55,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:24:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:24:55,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:55,799 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:55,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:55,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash -950577258, now seen corresponding path program 1 times [2024-11-08 16:24:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:24:55,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056798772] [2024-11-08 16:24:55,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:55,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:24:55,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:24:55,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:24:55,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:24:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:57,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:24:57,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:24:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-11-08 16:24:57,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:24:57,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:24:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056798772] [2024-11-08 16:24:57,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056798772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:57,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:57,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:24:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676070388] [2024-11-08 16:24:57,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:57,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:24:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:24:57,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:24:57,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:24:57,427 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:24:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:24:57,483 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-11-08 16:24:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:24:57,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-08 16:24:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:24:57,497 INFO L225 Difference]: With dead ends: 271 [2024-11-08 16:24:57,498 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 16:24:57,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:24:57,507 INFO L432 NwaCegarLoop]: 201 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, 201 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:24:57,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:24:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 16:24:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-08 16:24:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-11-08 16:24:57,570 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-11-08 16:24:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:24:57,571 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-11-08 16:24:57,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:24:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-11-08 16:24:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:24:57,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:57,576 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:57,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 16:24:57,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:24:57,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:57,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1510452990, now seen corresponding path program 1 times [2024-11-08 16:24:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:24:57,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395011422] [2024-11-08 16:24:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:57,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:24:57,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:24:57,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:24:57,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:24:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:24:59,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:24:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:24:59,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:24:59,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:24:59,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395011422] [2024-11-08 16:24:59,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395011422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:59,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:59,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:24:59,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149404160] [2024-11-08 16:24:59,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:59,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:24:59,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:24:59,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:24:59,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:24:59,408 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:24:59,594 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2024-11-08 16:24:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:24:59,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-08 16:24:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:24:59,598 INFO L225 Difference]: With dead ends: 269 [2024-11-08 16:24:59,598 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 16:24:59,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:24:59,602 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:24:59,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:24:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 16:24:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-08 16:24:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:24:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-11-08 16:24:59,637 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2024-11-08 16:24:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:24:59,640 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-11-08 16:24:59,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:24:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-11-08 16:24:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 16:24:59,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:59,651 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:59,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 16:24:59,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:24:59,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:59,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash -276470206, now seen corresponding path program 1 times [2024-11-08 16:24:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:24:59,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740996924] [2024-11-08 16:24:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:59,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 16:24:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:24:59,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:24:59,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:25:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:01,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:25:01,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:25:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:25:01,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:25:01,394 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:25:01,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740996924] [2024-11-08 16:25:01,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740996924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:01,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:01,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:25:01,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756491211] [2024-11-08 16:25:01,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:01,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:25:01,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:25:01,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:25:01,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:25:01,399 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:25:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:01,650 INFO L93 Difference]: Finished difference Result 274 states and 407 transitions. [2024-11-08 16:25:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:25:01,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-08 16:25:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:01,654 INFO L225 Difference]: With dead ends: 274 [2024-11-08 16:25:01,654 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 16:25:01,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:25:01,657 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:01,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:25:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 16:25:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-08 16:25:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 122 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:25:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2024-11-08 16:25:01,673 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 135 [2024-11-08 16:25:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:01,674 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2024-11-08 16:25:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:25:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2024-11-08 16:25:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 16:25:01,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:01,679 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:01,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:25:01,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:25:01,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:01,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1323516005, now seen corresponding path program 1 times [2024-11-08 16:25:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:25:01,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153831389] [2024-11-08 16:25:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:01,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:25:01,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:25:01,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:25:01,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:25:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:25:03,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:25:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:25:03,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:25:03,746 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:25:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153831389] [2024-11-08 16:25:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153831389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:03,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:03,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:25:03,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235767315] [2024-11-08 16:25:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:03,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:25:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:25:03,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:25:03,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:25:03,751 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:25:08,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:25:12,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:25:17,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:25:21,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:25:25,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:25:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:25,522 INFO L93 Difference]: Finished difference Result 402 states and 593 transitions. [2024-11-08 16:25:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:25:25,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-08 16:25:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:25,527 INFO L225 Difference]: With dead ends: 402 [2024-11-08 16:25:25,527 INFO L226 Difference]: Without dead ends: 265 [2024-11-08 16:25:25,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:25:25,530 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 172 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:25,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 687 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 5 Unknown, 0 Unchecked, 21.5s Time] [2024-11-08 16:25:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-08 16:25:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2024-11-08 16:25:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 226 states have (on average 1.4115044247787611) internal successors, (319), 226 states have internal predecessors, (319), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:25:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 383 transitions. [2024-11-08 16:25:25,580 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 383 transitions. Word has length 136 [2024-11-08 16:25:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:25,581 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 383 transitions. [2024-11-08 16:25:25,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:25:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 383 transitions. [2024-11-08 16:25:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:25:25,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:25,589 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:25,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 16:25:25,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:25:25,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:25,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2019188951, now seen corresponding path program 1 times [2024-11-08 16:25:25,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:25:25,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124215872] [2024-11-08 16:25:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:25:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:25:25,798 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:25:25,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:25:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:27,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:25:27,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:25:27,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-08 16:25:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:25:29,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:25:29,216 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:25:29,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124215872] [2024-11-08 16:25:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124215872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:29,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:29,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:25:29,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947112122] [2024-11-08 16:25:29,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:29,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:25:29,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:25:29,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:25:29,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:25:29,220 INFO L87 Difference]: Start difference. First operand 261 states and 383 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:25:33,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:25:37,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:25:42,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:25:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:42,474 INFO L93 Difference]: Finished difference Result 755 states and 1104 transitions. [2024-11-08 16:25:42,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:25:42,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-08 16:25:42,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:42,480 INFO L225 Difference]: With dead ends: 755 [2024-11-08 16:25:42,480 INFO L226 Difference]: Without dead ends: 497 [2024-11-08 16:25:42,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:25:42,483 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 304 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 39 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:42,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 551 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 13.2s Time] [2024-11-08 16:25:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-08 16:25:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 427. [2024-11-08 16:25:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 375 states have (on average 1.4026666666666667) internal successors, (526), 375 states have internal predecessors, (526), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 16:25:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 622 transitions. [2024-11-08 16:25:42,548 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 622 transitions. Word has length 137 [2024-11-08 16:25:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:42,549 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 622 transitions. [2024-11-08 16:25:42,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:25:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 622 transitions. [2024-11-08 16:25:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:25:42,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:42,556 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:42,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 16:25:42,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:25:42,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:42,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash 54274420, now seen corresponding path program 1 times [2024-11-08 16:25:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:25:42,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789670344] [2024-11-08 16:25:42,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:42,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:25:42,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:25:42,767 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:25:42,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:25:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:25:44,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:25:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:25:44,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:25:44,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:25:44,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789670344] [2024-11-08 16:25:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789670344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:44,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:44,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:25:44,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295158799] [2024-11-08 16:25:44,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:44,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:25:44,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:25:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:25:44,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:25:44,455 INFO L87 Difference]: Start difference. First operand 427 states and 622 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:25:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:44,741 INFO L93 Difference]: Finished difference Result 860 states and 1253 transitions. [2024-11-08 16:25:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:25:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-08 16:25:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:44,746 INFO L225 Difference]: With dead ends: 860 [2024-11-08 16:25:44,747 INFO L226 Difference]: Without dead ends: 436 [2024-11-08 16:25:44,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:25:44,750 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:44,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:25:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-08 16:25:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2024-11-08 16:25:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 384 states have (on average 1.3932291666666667) internal successors, (535), 384 states have internal predecessors, (535), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 16:25:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 631 transitions. [2024-11-08 16:25:44,793 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 631 transitions. Word has length 137 [2024-11-08 16:25:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:44,794 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 631 transitions. [2024-11-08 16:25:44,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:25:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 631 transitions. [2024-11-08 16:25:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 16:25:44,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:44,798 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:44,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 16:25:44,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:25:44,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:44,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1068696692, now seen corresponding path program 1 times [2024-11-08 16:25:45,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:25:45,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786198560] [2024-11-08 16:25:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:45,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:25:45,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:25:45,006 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:25:45,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 16:25:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:46,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:25:46,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:25:47,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:25:47,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 16:25:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 16:25:47,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:25:47,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:25:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786198560] [2024-11-08 16:25:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786198560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:47,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:47,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:25:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326301238] [2024-11-08 16:25:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:47,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:25:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:25:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:25:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:25:47,730 INFO L87 Difference]: Start difference. First operand 436 states and 631 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:25:53,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:25:57,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:01,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:05,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:09,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:13,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:17,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:21,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:25,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:29,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:33,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:37,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:42,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:46,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:50,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:54,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:26:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:55,090 INFO L93 Difference]: Finished difference Result 872 states and 1262 transitions. [2024-11-08 16:26:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:26:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2024-11-08 16:26:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:55,103 INFO L225 Difference]: With dead ends: 872 [2024-11-08 16:26:55,103 INFO L226 Difference]: Without dead ends: 439 [2024-11-08 16:26:55,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:26:55,106 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 175 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:55,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 653 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 16 Unknown, 0 Unchecked, 67.1s Time] [2024-11-08 16:26:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-08 16:26:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2024-11-08 16:26:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 384 states have (on average 1.3854166666666667) internal successors, (532), 384 states have internal predecessors, (532), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 16:26:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 628 transitions. [2024-11-08 16:26:55,146 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 628 transitions. Word has length 138 [2024-11-08 16:26:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:55,147 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 628 transitions. [2024-11-08 16:26:55,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:26:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 628 transitions. [2024-11-08 16:26:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 16:26:55,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:55,150 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:55,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:26:55,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:26:55,355 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:55,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1222095002, now seen corresponding path program 1 times [2024-11-08 16:26:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:26:55,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115733893] [2024-11-08 16:26:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:55,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:26:55,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:26:55,362 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:26:55,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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 16:26:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 16:26:56,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:26:58,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 26 [2024-11-08 16:26:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:26:58,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:26:58,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:26:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115733893] [2024-11-08 16:26:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115733893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:58,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:58,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:26:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126471158] [2024-11-08 16:26:58,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:58,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:26:58,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:26:58,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:26:58,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:26:58,982 INFO L87 Difference]: Start difference. First operand 436 states and 628 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:27:04,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:27:08,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:27:12,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:27:17,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:27:21,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:27:25,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:27:29,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:27:33,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:27:37,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:27:41,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:27:45,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:27:48,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:27:52,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:27:56,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:28:00,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:28:04,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:28:09,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:28:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:12,769 INFO L93 Difference]: Finished difference Result 1167 states and 1686 transitions. [2024-11-08 16:28:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:28:12,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-08 16:28:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:12,785 INFO L225 Difference]: With dead ends: 1167 [2024-11-08 16:28:12,786 INFO L226 Difference]: Without dead ends: 734 [2024-11-08 16:28:12,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:28:12,791 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 300 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 3 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:28:12,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 774 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 73.5s Time] [2024-11-08 16:28:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-11-08 16:28:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 724. [2024-11-08 16:28:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 621 states have (on average 1.3687600644122384) internal successors, (850), 621 states have internal predecessors, (850), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-08 16:28:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1042 transitions. [2024-11-08 16:28:12,974 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1042 transitions. Word has length 140 [2024-11-08 16:28:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:12,974 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1042 transitions. [2024-11-08 16:28:12,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:28:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1042 transitions. [2024-11-08 16:28:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:28:12,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:12,978 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:28:13,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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 16:28:13,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:28:13,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:13,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1966890831, now seen corresponding path program 1 times [2024-11-08 16:28:13,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:28:13,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148790961] [2024-11-08 16:28:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:13,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:28:13,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:28:13,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:28:13,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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 [2024-11-08 16:28:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:14,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 16:28:14,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:28:20,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:28:20,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 301 treesize of output 97 [2024-11-08 16:28:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 10 proven. 250 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 16:28:21,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:28:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:28:23,471 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:28:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148790961] [2024-11-08 16:28:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148790961] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:28:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:28:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2024-11-08 16:28:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087934961] [2024-11-08 16:28:23,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:28:23,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:28:23,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:28:23,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:28:23,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:28:23,475 INFO L87 Difference]: Start difference. First operand 724 states and 1042 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:28:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:24,592 INFO L93 Difference]: Finished difference Result 1763 states and 2519 transitions. [2024-11-08 16:28:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:28:24,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-08 16:28:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:24,601 INFO L225 Difference]: With dead ends: 1763 [2024-11-08 16:28:24,601 INFO L226 Difference]: Without dead ends: 1102 [2024-11-08 16:28:24,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:28:24,604 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 102 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:28:24,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 749 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:28:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-08 16:28:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1050. [2024-11-08 16:28:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 921 states have (on average 1.3637350705754614) internal successors, (1256), 926 states have internal predecessors, (1256), 116 states have call successors, (116), 12 states have call predecessors, (116), 12 states have return successors, (116), 111 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-08 16:28:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1488 transitions. [2024-11-08 16:28:24,699 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1488 transitions. Word has length 141 [2024-11-08 16:28:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:24,702 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1488 transitions. [2024-11-08 16:28:24,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:28:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1488 transitions. [2024-11-08 16:28:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:28:24,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:24,706 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:28:24,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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)] Ended with exit code 0 [2024-11-08 16:28:24,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:28:24,907 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:24,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash 615134143, now seen corresponding path program 1 times [2024-11-08 16:28:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:28:24,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893837914] [2024-11-08 16:28:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:24,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:28:24,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:28:24,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:28:24,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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 (11)] Waiting until timeout for monitored process [2024-11-08 16:28:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:26,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:28:26,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:28:26,744 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 80 treesize of output 26 [2024-11-08 16:28:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:28:26,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:28:26,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:28:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893837914] [2024-11-08 16:28:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893837914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:28:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:28:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:28:26,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636787852] [2024-11-08 16:28:26,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:28:26,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:28:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:28:26,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:28:26,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:28:26,871 INFO L87 Difference]: Start difference. First operand 1050 states and 1488 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:28:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:30,254 INFO L93 Difference]: Finished difference Result 2017 states and 2860 transitions. [2024-11-08 16:28:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:28:30,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-08 16:28:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:30,264 INFO L225 Difference]: With dead ends: 2017 [2024-11-08 16:28:30,265 INFO L226 Difference]: Without dead ends: 1036 [2024-11-08 16:28:30,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:28:30,268 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 163 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:28:30,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 997 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 16:28:30,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-11-08 16:28:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1026. [2024-11-08 16:28:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 897 states have (on average 1.3567447045707914) internal successors, (1217), 902 states have internal predecessors, (1217), 116 states have call successors, (116), 12 states have call predecessors, (116), 12 states have return successors, (116), 111 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-08 16:28:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1449 transitions. [2024-11-08 16:28:30,386 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1449 transitions. Word has length 141 [2024-11-08 16:28:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:30,387 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1449 transitions. [2024-11-08 16:28:30,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:28:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1449 transitions. [2024-11-08 16:28:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:28:30,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:30,390 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:28:30,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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 (11)] Ended with exit code 0 [2024-11-08 16:28:30,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:28:30,591 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:30,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1819674308, now seen corresponding path program 1 times [2024-11-08 16:28:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:28:30,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169379364] [2024-11-08 16:28:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:30,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:28:30,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:28:30,597 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:28:30,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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 (12)] Waiting until timeout for monitored process [2024-11-08 16:28:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:32,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 16:28:32,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:28:33,319 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 47 treesize of output 23 [2024-11-08 16:28:33,496 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 51 treesize of output 23 [2024-11-08 16:28:34,780 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 86 treesize of output 32 [2024-11-08 16:28:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:28:34,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:28:34,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:28:34,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169379364] [2024-11-08 16:28:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169379364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:28:34,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:28:34,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:28:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070745875] [2024-11-08 16:28:34,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:28:34,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:28:34,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:28:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:28:34,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:28:34,991 INFO L87 Difference]: Start difference. First operand 1026 states and 1449 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:28:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:37,540 INFO L93 Difference]: Finished difference Result 2381 states and 3371 transitions. [2024-11-08 16:28:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:28:37,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-08 16:28:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:37,558 INFO L225 Difference]: With dead ends: 2381 [2024-11-08 16:28:37,559 INFO L226 Difference]: Without dead ends: 1424 [2024-11-08 16:28:37,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:28:37,563 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 125 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:28:37,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 544 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 16:28:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2024-11-08 16:28:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1408. [2024-11-08 16:28:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1235 states have (on average 1.3619433198380566) internal successors, (1682), 1242 states have internal predecessors, (1682), 156 states have call successors, (156), 16 states have call predecessors, (156), 16 states have return successors, (156), 149 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-08 16:28:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1994 transitions. [2024-11-08 16:28:37,689 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1994 transitions. Word has length 141 [2024-11-08 16:28:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:37,690 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 1994 transitions. [2024-11-08 16:28:37,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:28:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1994 transitions. [2024-11-08 16:28:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 16:28:37,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:37,694 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:28:37,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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 (12)] Forceful destruction successful, exit code 0 [2024-11-08 16:28:37,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:28:37,896 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:37,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1825991093, now seen corresponding path program 1 times [2024-11-08 16:28:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:28:37,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121670067] [2024-11-08 16:28:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:37,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:28:37,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:28:37,901 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:28:37,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed38fbc-4f08-4327-8810-f229a13e9557/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 (13)] Waiting until timeout for monitored process