./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:12:06,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:12:06,567 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:12:06,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:12:06,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:12:06,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:12:06,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:12:06,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:12:06,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:12:06,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:12:06,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:12:06,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:12:06,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:12:06,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:12:06,602 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:12:06,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:12:06,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:12:06,604 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:12:06,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:12:06,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:12:06,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:12:06,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:12:06,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:12:06,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:12:06,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:12:06,610 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:12:06,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:12:06,611 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:12:06,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:12:06,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:12:06,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:12:06,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:12:06,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:12:06,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:12:06,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:12:06,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:12:06,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:12:06,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:12:06,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:12:06,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:12:06,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:12:06,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:12:06,622 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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 -> bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 [2024-11-08 18:12:06,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:12:06,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:12:06,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:12:06,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:12:06,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:12:06,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i Unable to find full path for "g++" [2024-11-08 18:12:08,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:12:09,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:12:09,163 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-08 18:12:09,177 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/data/84b5d9552/fc7c29c42e2444fa89da9a9955691b1d/FLAG06ac1cb3a [2024-11-08 18:12:09,196 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/data/84b5d9552/fc7c29c42e2444fa89da9a9955691b1d [2024-11-08 18:12:09,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:12:09,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:12:09,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:12:09,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:12:09,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:12:09,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2361a15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09, skipping insertion in model container [2024-11-08 18:12:09,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:12:09,430 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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-08 18:12:09,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:12:09,521 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:12:09,531 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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-08 18:12:09,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:12:09,610 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:12:09,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09 WrapperNode [2024-11-08 18:12:09,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:12:09,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:12:09,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:12:09,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:12:09,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,718 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-11-08 18:12:09,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:12:09,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:12:09,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:12:09,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:12:09,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,800 INFO L175 MemorySlicer]: Split 141 memory accesses to 5 slices as follows [2, 22, 35, 9, 73]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 9]. The 21 writes are split as follows [0, 3, 5, 2, 11]. [2024-11-08 18:12:09,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:12:09,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:12:09,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:12:09,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:12:09,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (1/1) ... [2024-11-08 18:12:09,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:12:09,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:12:09,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:12:09,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:12:09,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:12:09,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 18:12:09,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 18:12:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 18:12:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 18:12:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 18:12:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:12:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:12:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 18:12:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 18:12:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 18:12:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 18:12:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 18:12:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 18:12:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 18:12:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 18:12:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:12:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:12:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 18:12:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 18:12:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 18:12:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 18:12:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 18:12:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 18:12:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 18:12:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 18:12:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:12:09,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:12:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:12:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:12:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 18:12:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 18:12:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 18:12:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:12:09,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:12:10,151 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:12:10,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:12:10,729 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-08 18:12:10,729 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:12:10,744 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:12:10,744 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:12:10,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:10 BoogieIcfgContainer [2024-11-08 18:12:10,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:12:10,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:12:10,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:12:10,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:12:10,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:12:09" (1/3) ... [2024-11-08 18:12:10,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17667a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:12:10, skipping insertion in model container [2024-11-08 18:12:10,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:09" (2/3) ... [2024-11-08 18:12:10,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17667a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:12:10, skipping insertion in model container [2024-11-08 18:12:10,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:10" (3/3) ... [2024-11-08 18:12:10,753 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-38.i [2024-11-08 18:12:10,770 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:12:10,770 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:12:10,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:12:10,841 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;@3517bcff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:12:10,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:12:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 18:12:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:12:10,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:10,862 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:12:10,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:10,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1780304934, now seen corresponding path program 1 times [2024-11-08 18:12:10,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:10,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636412469] [2024-11-08 18:12:10,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:10,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:12:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:12:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:12:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:12:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:12:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:12:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:12:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:12:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 18:12:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:12:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:12:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:12:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:12:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:12:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:12:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:12:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:12:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:12:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:12:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:12:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:12:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 18:12:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 18:12:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 18:12:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:12:11,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636412469] [2024-11-08 18:12:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636412469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:11,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:12:11,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584043081] [2024-11-08 18:12:11,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:11,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:12:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:11,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:12:11,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:12:11,554 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 18:12:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:11,608 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-08 18:12:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:12:11,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-08 18:12:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:11,620 INFO L225 Difference]: With dead ends: 237 [2024-11-08 18:12:11,620 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 18:12:11,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 18:12:11,632 INFO L432 NwaCegarLoop]: 172 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, 172 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 18:12:11,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:12:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 18:12:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-08 18:12:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 18:12:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-08 18:12:11,695 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-08 18:12:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:11,699 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-08 18:12:11,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 18:12:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-08 18:12:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:12:11,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:11,707 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:12:11,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:12:11,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:11,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1346378702, now seen corresponding path program 1 times [2024-11-08 18:12:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362989161] [2024-11-08 18:12:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:12:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:12:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:12:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:12:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:12:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:12:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:12:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:12:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 18:12:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:12:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:12:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:12:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:12:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:12:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:12:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:12:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:12:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:12:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:12:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:12:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:12:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 18:12:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 18:12:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 18:12:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:12:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362989161] [2024-11-08 18:12:12,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362989161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:12,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:12,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:12:12,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088830691] [2024-11-08 18:12:12,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:12,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:12:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:12,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:12:12,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:12:12,770 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:12:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:12,960 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2024-11-08 18:12:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:12:12,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-08 18:12:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:12,964 INFO L225 Difference]: With dead ends: 268 [2024-11-08 18:12:12,964 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 18:12:12,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:12:12,966 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 48 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:12,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:12:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 18:12:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2024-11-08 18:12:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 18:12:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2024-11-08 18:12:12,981 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 184 [2024-11-08 18:12:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:12,987 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2024-11-08 18:12:12,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:12:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2024-11-08 18:12:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:12:12,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:12,992 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:12:12,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:12:12,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:12,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash -954553330, now seen corresponding path program 1 times [2024-11-08 18:12:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507865224] [2024-11-08 18:12:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:12:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:12:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:12:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:12:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:12:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:12:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:12:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:12:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 18:12:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:12:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:12:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:12:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:12:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:12:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:12:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:12:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:12:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:12:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:12:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:12:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:12:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 18:12:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 18:12:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 18:12:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:12:15,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:15,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507865224] [2024-11-08 18:12:15,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507865224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:15,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:15,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:12:15,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728121576] [2024-11-08 18:12:15,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:15,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:12:15,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:15,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:12:15,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:12:15,737 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 9 states, 7 states have (on average 9.571428571428571) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-08 18:12:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:16,510 INFO L93 Difference]: Finished difference Result 345 states and 501 transitions. [2024-11-08 18:12:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:12:16,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.571428571428571) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-08 18:12:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:16,514 INFO L225 Difference]: With dead ends: 345 [2024-11-08 18:12:16,514 INFO L226 Difference]: Without dead ends: 227 [2024-11-08 18:12:16,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:12:16,516 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 136 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:16,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1495 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:12:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-08 18:12:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2024-11-08 18:12:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 180 states have internal predecessors, (242), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:12:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 326 transitions. [2024-11-08 18:12:16,543 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 326 transitions. Word has length 184 [2024-11-08 18:12:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:16,543 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 326 transitions. [2024-11-08 18:12:16,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.571428571428571) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-08 18:12:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 326 transitions. [2024-11-08 18:12:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:12:16,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:16,547 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:12:16,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:12:16,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:16,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:16,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1541359344, now seen corresponding path program 1 times [2024-11-08 18:12:16,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:16,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738662128] [2024-11-08 18:12:16,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:16,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:12:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:12:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:12:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:12:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:12:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:12:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:12:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:12:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 18:12:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:12:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:12:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:12:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:12:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:12:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:12:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:12:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:12:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:12:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:12:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:12:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:12:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 18:12:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 18:12:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 18:12:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:12:18,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:18,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738662128] [2024-11-08 18:12:18,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738662128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:18,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:18,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:12:18,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232490616] [2024-11-08 18:12:18,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:18,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:12:18,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:18,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:12:18,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:12:18,559 INFO L87 Difference]: Start difference. First operand 224 states and 326 transitions. Second operand has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 18:12:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:19,312 INFO L93 Difference]: Finished difference Result 511 states and 744 transitions. [2024-11-08 18:12:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:12:19,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-08 18:12:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:19,318 INFO L225 Difference]: With dead ends: 511 [2024-11-08 18:12:19,318 INFO L226 Difference]: Without dead ends: 290 [2024-11-08 18:12:19,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:12:19,320 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 139 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:19,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 884 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:12:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-08 18:12:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2024-11-08 18:12:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 221 states have (on average 1.330316742081448) internal successors, (294), 223 states have internal predecessors, (294), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 18:12:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 418 transitions. [2024-11-08 18:12:19,364 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 418 transitions. Word has length 184 [2024-11-08 18:12:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:19,365 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 418 transitions. [2024-11-08 18:12:19,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 18:12:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 418 transitions. [2024-11-08 18:12:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:12:19,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:19,368 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:12:19,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:12:19,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:19,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash -735698612, now seen corresponding path program 1 times [2024-11-08 18:12:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:19,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012681678] [2024-11-08 18:12:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:12:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:12:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:12:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:12:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:12:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:12:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:12:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:12:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 18:12:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:12:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:12:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:12:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:12:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:12:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:12:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:12:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:12:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:12:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:12:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:12:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:12:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 18:12:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 18:12:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 18:12:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:12:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012681678] [2024-11-08 18:12:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012681678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:20,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:20,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:12:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359120869] [2024-11-08 18:12:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:20,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:12:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:20,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:12:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:12:20,854 INFO L87 Difference]: Start difference. First operand 287 states and 418 transitions. Second operand has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-08 18:12:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:21,486 INFO L93 Difference]: Finished difference Result 521 states and 751 transitions. [2024-11-08 18:12:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:12:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-08 18:12:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:21,490 INFO L225 Difference]: With dead ends: 521 [2024-11-08 18:12:21,490 INFO L226 Difference]: Without dead ends: 294 [2024-11-08 18:12:21,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:12:21,492 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 138 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:21,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1217 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:12:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-08 18:12:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 226. [2024-11-08 18:12:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 180 states have (on average 1.3333333333333333) internal successors, (240), 181 states have internal predecessors, (240), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:12:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 324 transitions. [2024-11-08 18:12:21,531 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 324 transitions. Word has length 184 [2024-11-08 18:12:21,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:21,532 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 324 transitions. [2024-11-08 18:12:21,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-08 18:12:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 324 transitions. [2024-11-08 18:12:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:12:21,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:21,535 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:12:21,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:12:21,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:21,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1322504626, now seen corresponding path program 1 times [2024-11-08 18:12:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:21,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6452769] [2024-11-08 18:12:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:21,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:12:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:12:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:12:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:12:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:12:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:12:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:12:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:12:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 18:12:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:12:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:12:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:12:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:12:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:12:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:12:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:12:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:12:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:12:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:12:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:12:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:12:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 18:12:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 18:12:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 18:12:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:12:23,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6452769] [2024-11-08 18:12:23,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6452769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:23,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:23,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 18:12:23,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581705122] [2024-11-08 18:12:23,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:23,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:12:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:23,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:12:23,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:12:23,597 INFO L87 Difference]: Start difference. First operand 226 states and 324 transitions. Second operand has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 18:12:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:24,649 INFO L93 Difference]: Finished difference Result 513 states and 737 transitions. [2024-11-08 18:12:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:12:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-08 18:12:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:24,653 INFO L225 Difference]: With dead ends: 513 [2024-11-08 18:12:24,653 INFO L226 Difference]: Without dead ends: 290 [2024-11-08 18:12:24,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:12:24,655 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 132 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:24,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2182 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:12:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-08 18:12:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 201. [2024-11-08 18:12:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 156 states have internal predecessors, (203), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:12:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 287 transitions. [2024-11-08 18:12:24,694 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 287 transitions. Word has length 184 [2024-11-08 18:12:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:24,695 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 287 transitions. [2024-11-08 18:12:24,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 18:12:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 287 transitions. [2024-11-08 18:12:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 18:12:24,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:24,698 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:12:24,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:12:24,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:24,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1976016279, now seen corresponding path program 1 times [2024-11-08 18:12:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868438042] [2024-11-08 18:12:24,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:12:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:12:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:12:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:12:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:12:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:12:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:12:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:12:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 18:12:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:12:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:12:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:12:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:12:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:12:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:12:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:12:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:12:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:12:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:12:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:12:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:12:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 18:12:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 18:12:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 18:12:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:12:33,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868438042] [2024-11-08 18:12:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868438042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:12:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985108893] [2024-11-08 18:12:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:33,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:12:33,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:33,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:12:33,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:12:33,979 INFO L87 Difference]: Start difference. First operand 201 states and 287 transitions. Second operand has 17 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-08 18:12:38,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:12:43,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:12:49,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:12:54,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:12:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:57,911 INFO L93 Difference]: Finished difference Result 432 states and 611 transitions. [2024-11-08 18:12:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 18:12:57,912 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) Word has length 186 [2024-11-08 18:12:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:57,915 INFO L225 Difference]: With dead ends: 432 [2024-11-08 18:12:57,915 INFO L226 Difference]: Without dead ends: 291 [2024-11-08 18:12:57,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-08 18:12:57,917 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 244 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 32 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:57,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 2103 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1216 Invalid, 3 Unknown, 0 Unchecked, 22.4s Time] [2024-11-08 18:12:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-08 18:12:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2024-11-08 18:12:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 230 states have (on average 1.326086956521739) internal successors, (305), 232 states have internal predecessors, (305), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 18:12:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 409 transitions. [2024-11-08 18:12:57,977 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 409 transitions. Word has length 186 [2024-11-08 18:12:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:57,978 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 409 transitions. [2024-11-08 18:12:57,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-08 18:12:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 409 transitions. [2024-11-08 18:12:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 18:12:57,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:57,982 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:12:57,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:12:57,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:57,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1638892647, now seen corresponding path program 1 times [2024-11-08 18:12:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:57,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275415646] [2024-11-08 18:12:57,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:57,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:12:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:12:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:12:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:12:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:12:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:12:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:12:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:12:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 18:12:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:12:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:12:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:12:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:12:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:12:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:12:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:12:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:12:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 18:12:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 18:12:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:12:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:12:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 18:12:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 18:12:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 18:12:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-08 18:12:59,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:59,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275415646] [2024-11-08 18:12:59,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275415646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:12:59,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716526515] [2024-11-08 18:12:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:59,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:12:59,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:12:59,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:12:59,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:13:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:00,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 18:13:00,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:00,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:00,405 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 19 treesize of output 7 [2024-11-08 18:13:00,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 18:13:00,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:00,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-08 18:13:00,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:00,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-08 18:13:00,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:00,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2024-11-08 18:13:01,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:01,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 26 [2024-11-08 18:13:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 371 proven. 18 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-11-08 18:13:01,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:13:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 114 proven. 21 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 18:13:02,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716526515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:13:02,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:13:02,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 31 [2024-11-08 18:13:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071550596] [2024-11-08 18:13:02,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:13:02,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 18:13:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 18:13:02,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-08 18:13:02,647 INFO L87 Difference]: Start difference. First operand 287 states and 409 transitions. Second operand has 31 states, 25 states have (on average 4.88) internal successors, (122), 29 states have internal predecessors, (122), 11 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (33), 7 states have call predecessors, (33), 11 states have call successors, (33) [2024-11-08 18:13:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:05,974 INFO L93 Difference]: Finished difference Result 537 states and 749 transitions. [2024-11-08 18:13:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 18:13:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 4.88) internal successors, (122), 29 states have internal predecessors, (122), 11 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (33), 7 states have call predecessors, (33), 11 states have call successors, (33) Word has length 186 [2024-11-08 18:13:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:05,977 INFO L225 Difference]: With dead ends: 537 [2024-11-08 18:13:05,977 INFO L226 Difference]: Without dead ends: 310 [2024-11-08 18:13:05,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=577, Invalid=2179, Unknown=0, NotChecked=0, Total=2756 [2024-11-08 18:13:05,980 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1347 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:05,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 1309 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:13:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-08 18:13:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 152. [2024-11-08 18:13:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 122 states have internal predecessors, (155), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 18:13:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 203 transitions. [2024-11-08 18:13:06,015 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 203 transitions. Word has length 186 [2024-11-08 18:13:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:06,016 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 203 transitions. [2024-11-08 18:13:06,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 4.88) internal successors, (122), 29 states have internal predecessors, (122), 11 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (33), 7 states have call predecessors, (33), 11 states have call successors, (33) [2024-11-08 18:13:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 203 transitions. [2024-11-08 18:13:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 18:13:06,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:06,019 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:06,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:13:06,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 18:13:06,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2115912803, now seen corresponding path program 1 times [2024-11-08 18:13:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:06,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158538312] [2024-11-08 18:13:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:13:06,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:13:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:13:06,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:13:06,590 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:13:06,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:13:06,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:13:06,596 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:06,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:13:06,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:13:06 BoogieIcfgContainer [2024-11-08 18:13:06,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:13:06,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:13:06,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:13:06,733 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:13:06,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:10" (3/4) ... [2024-11-08 18:13:06,737 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:13:06,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:13:06,739 INFO L158 Benchmark]: Toolchain (without parser) took 57538.50ms. Allocated memory was 117.4MB in the beginning and 564.1MB in the end (delta: 446.7MB). Free memory was 75.6MB in the beginning and 323.6MB in the end (delta: -248.1MB). Peak memory consumption was 199.1MB. Max. memory is 16.1GB. [2024-11-08 18:13:06,739 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:13:06,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.05ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 57.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 18:13:06,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.24ms. Allocated memory was 117.4MB in the beginning and 155.2MB in the end (delta: 37.7MB). Free memory was 57.9MB in the beginning and 123.4MB in the end (delta: -65.6MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-08 18:13:06,740 INFO L158 Benchmark]: Boogie Preprocessor took 154.27ms. Allocated memory is still 155.2MB. Free memory was 123.4MB in the beginning and 120.6MB in the end (delta: 2.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-08 18:13:06,740 INFO L158 Benchmark]: RCFGBuilder took 870.40ms. Allocated memory is still 155.2MB. Free memory was 120.6MB in the beginning and 82.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 18:13:06,741 INFO L158 Benchmark]: TraceAbstraction took 55985.65ms. Allocated memory was 155.2MB in the beginning and 564.1MB in the end (delta: 408.9MB). Free memory was 82.9MB in the beginning and 323.6MB in the end (delta: -240.7MB). Peak memory consumption was 168.1MB. Max. memory is 16.1GB. [2024-11-08 18:13:06,742 INFO L158 Benchmark]: Witness Printer took 5.37ms. Allocated memory is still 564.1MB. Free memory is still 323.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:13:06,743 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.28ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.05ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 57.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.24ms. Allocated memory was 117.4MB in the beginning and 155.2MB in the end (delta: 37.7MB). Free memory was 57.9MB in the beginning and 123.4MB in the end (delta: -65.6MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 154.27ms. Allocated memory is still 155.2MB. Free memory was 123.4MB in the beginning and 120.6MB in the end (delta: 2.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 870.40ms. Allocated memory is still 155.2MB. Free memory was 120.6MB in the beginning and 82.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 55985.65ms. Allocated memory was 155.2MB in the beginning and 564.1MB in the end (delta: 408.9MB). Free memory was 82.9MB in the beginning and 323.6MB in the end (delta: -240.7MB). Peak memory consumption was 168.1MB. Max. memory is 16.1GB. * Witness Printer took 5.37ms. Allocated memory is still 564.1MB. Free memory is still 323.6MB. 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 100, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L58] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L59] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L61] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L62] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L64] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] double_Array_0[0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] double_Array_0[1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] double_Array_0[2] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] double_Array_0[4] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L76] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L79] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L82] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] unsigned_short_int_Array_0[2][1] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L93] unsigned_short_int_Array_0[1][2] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR unsigned_short_int_Array_0[2][1] [L37] unsigned_short_int_Array_0[2][2] = (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]) [L38] EXPR unsigned_short_int_Array_0[1][2] [L38] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[1][2]; [L39] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND FALSE !(unsigned_short_int_Array_0[2][1] > stepLocal_0) [L42] EXPR double_Array_0[1] [L42] EXPR double_Array_0[0] [L42] EXPR double_Array_0[2] [L42] EXPR double_Array_0[4] [L42] double_Array_0[3] = (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))) [L43] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L43] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L44] EXPR unsigned_short_int_Array_0[0][2] [L44] EXPR unsigned_short_int_Array_0[0][1] [L44] EXPR unsigned_short_int_Array_0[1][1] [L44] unsigned_short_int_Array_0[0][0] = (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])) [L52] EXPR BOOL_unsigned_char_Array_0[2] [L52] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[2]; [L53] EXPR BOOL_unsigned_char_Array_0[0] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] COND FALSE !((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && stepLocal_1) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR unsigned_short_int_Array_0[2][2] [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) [L100] EXPR double_Array_0[3] [L100] EXPR double_Array_0[1] [L100] EXPR double_Array_0[0] [L100] EXPR double_Array_0[2] [L100] EXPR double_Array_0[4] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100-L101] return ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.8s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 2236 SdHoareTripleChecker+Valid, 27.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2184 mSDsluCounter, 9984 SdHoareTripleChecker+Invalid, 26.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8386 mSDsCounter, 658 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4706 IncrementalHoareTripleChecker+Invalid, 5367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 658 mSolverCounterUnsat, 1598 mSDtfsCounter, 4706 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 806 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=4, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 357 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 1848 NumberOfCodeBlocks, 1848 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1838 ConstructedInterpolants, 0 QuantifiedInterpolants, 7567 SizeOfPredicates, 7 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10983/11040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:13:06,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:13:09,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:13:09,264 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:13:09,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:13:09,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:13:09,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:13:09,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:13:09,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:13:09,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:13:09,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:13:09,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:13:09,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:13:09,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:13:09,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:13:09,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:13:09,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:13:09,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:13:09,318 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:13:09,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:13:09,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:13:09,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:13:09,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:13:09,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:13:09,324 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:13:09,324 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:13:09,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:13:09,325 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:13:09,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:13:09,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:13:09,326 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:13:09,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:13:09,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:13:09,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:13:09,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:13:09,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:13:09,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:13:09,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:13:09,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:13:09,330 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:13:09,330 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:13:09,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:13:09,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:13:09,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:13:09,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:13:09,332 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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 -> bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 [2024-11-08 18:13:09,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:13:09,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:13:09,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:13:09,773 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:13:09,773 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:13:09,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i Unable to find full path for "g++" [2024-11-08 18:13:11,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:13:12,054 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:13:12,058 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-08 18:13:12,079 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/data/bbc2cc5a7/2f3b36c6126e4a4ca08662ddb2c34e3e/FLAGe95c4ed6c [2024-11-08 18:13:12,103 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/data/bbc2cc5a7/2f3b36c6126e4a4ca08662ddb2c34e3e [2024-11-08 18:13:12,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:13:12,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:13:12,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:13:12,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:13:12,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:13:12,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d010997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12, skipping insertion in model container [2024-11-08 18:13:12,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:13:12,406 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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-08 18:13:12,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:13:12,507 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:13:12,525 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_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-08 18:13:12,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:13:12,627 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:13:12,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12 WrapperNode [2024-11-08 18:13:12,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:13:12,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:13:12,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:13:12,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:13:12,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,742 INFO L138 Inliner]: procedures = 36, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-11-08 18:13:12,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:13:12,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:13:12,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:13:12,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:13:12,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,819 INFO L175 MemorySlicer]: Split 141 memory accesses to 5 slices as follows [2, 22, 35, 9, 73]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 9]. The 21 writes are split as follows [0, 3, 5, 2, 11]. [2024-11-08 18:13:12,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:13:12,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:13:12,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:13:12,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:13:12,887 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (1/1) ... [2024-11-08 18:13:12,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:13:12,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:13:12,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:13:12,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:13:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:13:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 18:13:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 18:13:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 18:13:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 18:13:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 18:13:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 18:13:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 18:13:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 18:13:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 18:13:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 18:13:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 18:13:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 18:13:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 18:13:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 18:13:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 18:13:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 18:13:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 18:13:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 18:13:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 18:13:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 18:13:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:13:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:13:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 18:13:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 18:13:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 18:13:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 18:13:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 18:13:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 18:13:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 18:13:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 18:13:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 18:13:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 18:13:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 18:13:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 18:13:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 18:13:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 18:13:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 18:13:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 18:13:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 18:13:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 18:13:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 18:13:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 18:13:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 18:13:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 18:13:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 18:13:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:13:12,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:13:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:13:12,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:13:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 18:13:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 18:13:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 18:13:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 18:13:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 18:13:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 18:13:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 18:13:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 18:13:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 18:13:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 18:13:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 18:13:12,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 18:13:12,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 18:13:12,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 18:13:12,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 18:13:13,175 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:13:13,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:13:17,610 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-08 18:13:17,610 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:13:17,631 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:13:17,634 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:13:17,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:13:17 BoogieIcfgContainer [2024-11-08 18:13:17,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:13:17,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:13:17,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:13:17,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:13:17,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:13:12" (1/3) ... [2024-11-08 18:13:17,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235579c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:13:17, skipping insertion in model container [2024-11-08 18:13:17,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:12" (2/3) ... [2024-11-08 18:13:17,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235579c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:13:17, skipping insertion in model container [2024-11-08 18:13:17,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:13:17" (3/3) ... [2024-11-08 18:13:17,647 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-38.i [2024-11-08 18:13:17,666 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:13:17,667 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:13:17,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:13:17,735 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;@3fe1188f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:13:17,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:13:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 18:13:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:13:17,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:17,763 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:17,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:17,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1780304934, now seen corresponding path program 1 times [2024-11-08 18:13:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:13:17,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280215350] [2024-11-08 18:13:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:17,787 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 18:13:17,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:13:17,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:17,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:18,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:13:18,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-08 18:13:18,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:13:18,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:13:18,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280215350] [2024-11-08 18:13:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280215350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:18,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:13:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966413047] [2024-11-08 18:13:18,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:18,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:13:18,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:13:18,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:13:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:13:18,562 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 18:13:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:18,598 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-08 18:13:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:13:18,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-08 18:13:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:18,608 INFO L225 Difference]: With dead ends: 237 [2024-11-08 18:13:18,608 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 18:13:18,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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 18:13:18,616 INFO L432 NwaCegarLoop]: 172 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, 172 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 18:13:18,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:13:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 18:13:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-08 18:13:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 18:13:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-08 18:13:18,703 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-08 18:13:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:18,704 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-08 18:13:18,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 18:13:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-08 18:13:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:13:18,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:18,720 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:18,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:18,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:18,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:18,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1346378702, now seen corresponding path program 1 times [2024-11-08 18:13:18,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:13:18,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034743142] [2024-11-08 18:13:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:18,927 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 18:13:18,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:13:18,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:18,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:19,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:13:19,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:13:19,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:13:19,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:13:19,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034743142] [2024-11-08 18:13:19,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034743142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:19,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:19,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:13:19,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954306279] [2024-11-08 18:13:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:19,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:13:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:13:19,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:13:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:13:19,758 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:13:22,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:13:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:22,938 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2024-11-08 18:13:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:13:22,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-08 18:13:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:22,942 INFO L225 Difference]: With dead ends: 268 [2024-11-08 18:13:22,942 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 18:13:22,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:13:22,944 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 48 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:22,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 18:13:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 18:13:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2024-11-08 18:13:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 18:13:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2024-11-08 18:13:22,961 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 184 [2024-11-08 18:13:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:22,963 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2024-11-08 18:13:22,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:13:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2024-11-08 18:13:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:13:22,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:22,967 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:22,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:23,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:23,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:23,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash -954553330, now seen corresponding path program 1 times [2024-11-08 18:13:23,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:13:23,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493133085] [2024-11-08 18:13:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:23,170 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 18:13:23,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:13:23,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:23,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:24,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 18:13:24,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:24,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:13:24,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 18:13:24,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-08 18:13:25,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:25,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 26 [2024-11-08 18:13:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 385 proven. 15 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2024-11-08 18:13:25,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:13:27,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:13:27,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493133085] [2024-11-08 18:13:27,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493133085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:13:27,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410833630] [2024-11-08 18:13:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:27,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:13:27,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:13:27,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:13:27,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:13:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:27,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 18:13:27,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:27,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 18:13:27,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-08 18:13:28,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 33 [2024-11-08 18:13:28,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:28,976 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 42 treesize of output 18 [2024-11-08 18:13:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 385 proven. 12 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-08 18:13:29,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:13:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 120 proven. 15 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 18:13:30,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410833630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:13:30,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:13:30,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 31 [2024-11-08 18:13:30,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376950904] [2024-11-08 18:13:30,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:13:30,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 18:13:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:13:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 18:13:30,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 18:13:30,363 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 31 states, 25 states have (on average 4.56) internal successors, (114), 30 states have internal predecessors, (114), 12 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (33), 6 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-08 18:13:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:36,689 INFO L93 Difference]: Finished difference Result 365 states and 516 transitions. [2024-11-08 18:13:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 18:13:36,690 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 4.56) internal successors, (114), 30 states have internal predecessors, (114), 12 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (33), 6 states have call predecessors, (33), 12 states have call successors, (33) Word has length 184 [2024-11-08 18:13:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:36,693 INFO L225 Difference]: With dead ends: 365 [2024-11-08 18:13:36,693 INFO L226 Difference]: Without dead ends: 247 [2024-11-08 18:13:36,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 552 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=706, Invalid=2374, Unknown=0, NotChecked=0, Total=3080 [2024-11-08 18:13:36,696 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 715 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:36,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1417 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-08 18:13:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-08 18:13:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 238. [2024-11-08 18:13:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 189 states have (on average 1.3227513227513228) internal successors, (250), 190 states have internal predecessors, (250), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:13:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 334 transitions. [2024-11-08 18:13:36,734 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 334 transitions. Word has length 184 [2024-11-08 18:13:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:36,735 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 334 transitions. [2024-11-08 18:13:36,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 4.56) internal successors, (114), 30 states have internal predecessors, (114), 12 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (33), 6 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-08 18:13:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 334 transitions. [2024-11-08 18:13:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:13:36,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:36,740 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:36,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 18:13:36,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 18:13:37,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:13:37,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:37,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:37,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1772201780, now seen corresponding path program 1 times [2024-11-08 18:13:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:13:37,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133565003] [2024-11-08 18:13:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:37,144 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 18:13:37,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:13:37,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:37,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:38,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 18:13:38,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:38,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:13:38,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 18:13:38,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-08 18:13:38,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:38,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-08 18:13:38,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:38,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 92 [2024-11-08 18:13:38,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:38,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 151 treesize of output 69 [2024-11-08 18:13:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2024-11-08 18:13:39,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:13:39,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:13:39,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133565003] [2024-11-08 18:13:39,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133565003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:39,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:39,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:13:39,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263812951] [2024-11-08 18:13:39,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:39,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:13:39,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:13:39,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:13:39,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:13:39,030 INFO L87 Difference]: Start difference. First operand 238 states and 334 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 18:13:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:41,785 INFO L93 Difference]: Finished difference Result 623 states and 881 transitions. [2024-11-08 18:13:41,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:13:41,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-08 18:13:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:41,790 INFO L225 Difference]: With dead ends: 623 [2024-11-08 18:13:41,790 INFO L226 Difference]: Without dead ends: 388 [2024-11-08 18:13:41,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:13:41,792 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 488 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:41,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 830 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 18:13:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-08 18:13:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 321. [2024-11-08 18:13:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 257 states have (on average 1.3346303501945525) internal successors, (343), 259 states have internal predecessors, (343), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:13:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 455 transitions. [2024-11-08 18:13:41,870 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 455 transitions. Word has length 184 [2024-11-08 18:13:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:41,871 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 455 transitions. [2024-11-08 18:13:41,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 18:13:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 455 transitions. [2024-11-08 18:13:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:13:41,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:41,881 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:41,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:13:42,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:42,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:42,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1935959502, now seen corresponding path program 1 times [2024-11-08 18:13:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:13:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851360613] [2024-11-08 18:13:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:42,084 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 18:13:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:13:42,085 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:42,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:43,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 18:13:43,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:43,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 18:13:43,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 18:13:44,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:44,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2024-11-08 18:13:44,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:44,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 74 [2024-11-08 18:13:44,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:44,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 39 [2024-11-08 18:13:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 334 proven. 9 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-08 18:13:44,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:13:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:13:45,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:13:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851360613] [2024-11-08 18:13:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851360613] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:13:45,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:13:45,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2024-11-08 18:13:45,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964665974] [2024-11-08 18:13:45,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:45,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:13:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:13:45,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:13:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:13:45,335 INFO L87 Difference]: Start difference. First operand 321 states and 455 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:13:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:45,888 INFO L93 Difference]: Finished difference Result 648 states and 915 transitions. [2024-11-08 18:13:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:13:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-08 18:13:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:45,891 INFO L225 Difference]: With dead ends: 648 [2024-11-08 18:13:45,891 INFO L226 Difference]: Without dead ends: 330 [2024-11-08 18:13:45,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:13:45,894 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 238 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:45,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 482 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:13:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-08 18:13:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 319. [2024-11-08 18:13:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 255 states have (on average 1.3254901960784313) internal successors, (338), 257 states have internal predecessors, (338), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:13:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 450 transitions. [2024-11-08 18:13:45,938 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 450 transitions. Word has length 184 [2024-11-08 18:13:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:45,939 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 450 transitions. [2024-11-08 18:13:45,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:13:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 450 transitions. [2024-11-08 18:13:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:13:45,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:45,942 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:45,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:46,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:46,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:46,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:46,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1553347062, now seen corresponding path program 1 times [2024-11-08 18:13:46,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:13:46,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512313109] [2024-11-08 18:13:46,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:46,145 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 18:13:46,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:13:46,146 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:46,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:46,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 18:13:46,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:46,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:13:47,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 18:13:47,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:47,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 32 [2024-11-08 18:13:47,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:47,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 71 [2024-11-08 18:13:47,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:47,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 39 [2024-11-08 18:13:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 314 proven. 9 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-11-08 18:13:47,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:13:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:13:48,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:13:48,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512313109] [2024-11-08 18:13:48,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512313109] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:13:48,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:13:48,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-08 18:13:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021817975] [2024-11-08 18:13:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:48,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:13:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:13:48,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:13:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:13:48,462 INFO L87 Difference]: Start difference. First operand 319 states and 450 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:13:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:49,026 INFO L93 Difference]: Finished difference Result 650 states and 911 transitions. [2024-11-08 18:13:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:13:49,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-08 18:13:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:49,030 INFO L225 Difference]: With dead ends: 650 [2024-11-08 18:13:49,030 INFO L226 Difference]: Without dead ends: 334 [2024-11-08 18:13:49,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:13:49,032 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 234 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:49,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 655 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:13:49,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-08 18:13:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 237. [2024-11-08 18:13:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 192 states have internal predecessors, (249), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 18:13:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2024-11-08 18:13:49,066 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 184 [2024-11-08 18:13:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:49,067 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2024-11-08 18:13:49,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:13:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2024-11-08 18:13:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 18:13:49,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:49,070 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:49,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-08 18:13:49,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:49,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:49,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2140153076, now seen corresponding path program 1 times [2024-11-08 18:13:49,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:13:49,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838836656] [2024-11-08 18:13:49,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:49,272 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 18:13:49,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:13:49,273 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:49,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:50,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 18:13:50,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:50,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 18:13:50,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-08 18:13:50,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-08 18:13:50,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:50,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 54 [2024-11-08 18:13:50,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:50,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 97 [2024-11-08 18:13:51,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:51,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 156 treesize of output 74 [2024-11-08 18:13:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-08 18:13:51,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:13:51,178 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:13:51,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838836656] [2024-11-08 18:13:51,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838836656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:51,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:51,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:13:51,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725935626] [2024-11-08 18:13:51,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:51,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:13:51,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:13:51,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:13:51,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:13:51,179 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-08 18:13:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:55,097 INFO L93 Difference]: Finished difference Result 644 states and 896 transitions. [2024-11-08 18:13:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:13:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-08 18:13:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:55,100 INFO L225 Difference]: With dead ends: 644 [2024-11-08 18:13:55,100 INFO L226 Difference]: Without dead ends: 410 [2024-11-08 18:13:55,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:13:55,102 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 402 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:55,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1382 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 18:13:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-08 18:13:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 240. [2024-11-08 18:13:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 195 states have internal predecessors, (252), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 18:13:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 328 transitions. [2024-11-08 18:13:55,147 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 328 transitions. Word has length 184 [2024-11-08 18:13:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:55,148 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 328 transitions. [2024-11-08 18:13:55,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-08 18:13:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 328 transitions. [2024-11-08 18:13:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 18:13:55,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:55,150 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:55,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:55,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:55,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:55,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1260638899, now seen corresponding path program 1 times [2024-11-08 18:13:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:13:55,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077434338] [2024-11-08 18:13:55,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:55,352 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 18:13:55,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:13:55,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:55,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:55,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:13:55,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:55,900 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 18 treesize of output 10 [2024-11-08 18:13:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:13:55,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:13:55,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:13:55,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077434338] [2024-11-08 18:13:55,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077434338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:55,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:55,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:13:55,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983958581] [2024-11-08 18:13:55,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:55,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:13:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:13:55,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:13:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:13:55,928 INFO L87 Difference]: Start difference. First operand 240 states and 328 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:13:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:56,190 INFO L93 Difference]: Finished difference Result 477 states and 653 transitions. [2024-11-08 18:13:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:13:56,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 185 [2024-11-08 18:13:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:56,193 INFO L225 Difference]: With dead ends: 477 [2024-11-08 18:13:56,193 INFO L226 Difference]: Without dead ends: 240 [2024-11-08 18:13:56,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 182 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 18:13:56,195 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:56,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 482 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:13:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-08 18:13:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-08 18:13:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.288659793814433) internal successors, (250), 195 states have internal predecessors, (250), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 18:13:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 326 transitions. [2024-11-08 18:13:56,241 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 326 transitions. Word has length 185 [2024-11-08 18:13:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:56,244 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 326 transitions. [2024-11-08 18:13:56,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:13:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 326 transitions. [2024-11-08 18:13:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 18:13:56,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:56,247 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:13:56,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:56,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:56,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:56,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1757161561, now seen corresponding path program 1 times [2024-11-08 18:13:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:13:56,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001759976] [2024-11-08 18:13:56,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:56,449 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 18:13:56,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:13:56,451 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:56,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:13:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:57,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 18:13:57,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:57,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:13:57,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-08 18:13:57,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-08 18:13:58,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:58,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 53 [2024-11-08 18:13:59,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:59,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 92 [2024-11-08 18:13:59,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:13:59,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 40 [2024-11-08 18:13:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 386 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 18:13:59,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:14:00,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:14:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001759976] [2024-11-08 18:14:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001759976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:14:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739056618] [2024-11-08 18:14:00,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:00,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:14:00,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:14:00,739 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:14:00,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 18:14:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:01,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 18:14:01,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:14:01,159 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 26 treesize of output 25 [2024-11-08 18:14:01,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2024-11-08 18:14:02,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:14:02,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2024-11-08 18:14:02,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:14:02,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 85 [2024-11-08 18:14:03,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:14:03,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 45 [2024-11-08 18:14:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 385 proven. 12 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-08 18:14:03,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:14:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 120 proven. 15 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 18:14:04,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739056618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:14:04,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:14:04,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 11] total 35 [2024-11-08 18:14:04,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432494129] [2024-11-08 18:14:04,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:14:04,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 18:14:04,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:14:04,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 18:14:04,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1270, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 18:14:04,251 INFO L87 Difference]: Start difference. First operand 240 states and 326 transitions. Second operand has 35 states, 29 states have (on average 4.758620689655173) internal successors, (138), 33 states have internal predecessors, (138), 13 states have call successors, (33), 7 states have call predecessors, (33), 11 states have return successors, (33), 7 states have call predecessors, (33), 13 states have call successors, (33) [2024-11-08 18:14:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:15,096 INFO L93 Difference]: Finished difference Result 660 states and 906 transitions. [2024-11-08 18:14:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-08 18:14:15,097 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 4.758620689655173) internal successors, (138), 33 states have internal predecessors, (138), 13 states have call successors, (33), 7 states have call predecessors, (33), 11 states have return successors, (33), 7 states have call predecessors, (33), 13 states have call successors, (33) Word has length 186 [2024-11-08 18:14:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:15,099 INFO L225 Difference]: With dead ends: 660 [2024-11-08 18:14:15,100 INFO L226 Difference]: Without dead ends: 423 [2024-11-08 18:14:15,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 552 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=997, Invalid=3035, Unknown=0, NotChecked=0, Total=4032 [2024-11-08 18:14:15,102 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 1547 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:15,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 1970 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-08 18:14:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-08 18:14:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 240. [2024-11-08 18:14:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.2783505154639174) internal successors, (248), 195 states have internal predecessors, (248), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 18:14:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 324 transitions. [2024-11-08 18:14:15,155 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 324 transitions. Word has length 186 [2024-11-08 18:14:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:15,156 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 324 transitions. [2024-11-08 18:14:15,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 4.758620689655173) internal successors, (138), 33 states have internal predecessors, (138), 13 states have call successors, (33), 7 states have call predecessors, (33), 11 states have return successors, (33), 7 states have call predecessors, (33), 13 states have call successors, (33) [2024-11-08 18:14:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 324 transitions. [2024-11-08 18:14:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 18:14:15,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:15,158 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:14:15,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:14:15,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 18:14:15,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:14:15,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:15,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1498996123, now seen corresponding path program 1 times [2024-11-08 18:14:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:14:15,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642783270] [2024-11-08 18:14:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:15,560 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 18:14:15,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:14:15,562 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:14:15,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 [2024-11-08 18:14:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:16,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:14:16,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:14:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 18:14:16,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:14:16,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:14:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642783270] [2024-11-08 18:14:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642783270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:16,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:16,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:14:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350227673] [2024-11-08 18:14:16,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:16,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:14:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:14:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:14:16,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:14:16,116 INFO L87 Difference]: Start difference. First operand 240 states and 324 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:14:17,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:14:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:17,950 INFO L93 Difference]: Finished difference Result 479 states and 648 transitions. [2024-11-08 18:14:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:14:17,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 186 [2024-11-08 18:14:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:17,953 INFO L225 Difference]: With dead ends: 479 [2024-11-08 18:14:17,953 INFO L226 Difference]: Without dead ends: 242 [2024-11-08 18:14:17,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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 18:14:17,954 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:17,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 18:14:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-08 18:14:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-08 18:14:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 196 states have (on average 1.2704081632653061) internal successors, (249), 197 states have internal predecessors, (249), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 18:14:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 325 transitions. [2024-11-08 18:14:17,996 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 325 transitions. Word has length 186 [2024-11-08 18:14:17,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:17,997 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 325 transitions. [2024-11-08 18:14:17,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 18:14:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 325 transitions. [2024-11-08 18:14:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 18:14:17,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:17,999 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:14:18,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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)] Ended with exit code 0 [2024-11-08 18:14:18,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:14:18,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:18,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2115912803, now seen corresponding path program 1 times [2024-11-08 18:14:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:14:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948661211] [2024-11-08 18:14:18,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:18,201 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 18:14:18,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:14:18,204 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 18:14:18,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a43ec-f89a-468c-8c3c-e6f8b7bb2137/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 (14)] Waiting until timeout for monitored process