./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya --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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:23:12,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:23:12,267 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:23:12,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:23:12,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:23:12,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:23:12,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:23:12,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:23:12,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:23:12,303 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:23:12,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:23:12,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:23:12,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:23:12,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:23:12,307 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:23:12,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:23:12,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:23:12,308 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:23:12,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:23:12,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:23:12,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:23:12,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:23:12,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:23:12,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:23:12,312 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:23:12,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:23:12,313 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:23:12,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:23:12,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:23:12,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:23:12,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:23:12,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:23:12,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:23:12,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:23:12,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:23:12,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:23:12,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:23:12,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:23:12,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:23:12,318 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:23:12,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:23:12,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:23:12,319 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_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/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_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2023-11-29 00:23:12,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:23:12,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:23:12,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:23:12,583 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:23:12,583 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:23:12,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-11-29 00:23:15,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:23:15,534 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:23:15,535 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-11-29 00:23:15,541 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/data/9df3f6a2c/0c1933992e7d47b397d7a65776fc9e4b/FLAGa3db7365c [2023-11-29 00:23:15,554 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/data/9df3f6a2c/0c1933992e7d47b397d7a65776fc9e4b [2023-11-29 00:23:15,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:23:15,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:23:15,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:23:15,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:23:15,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:23:15,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c7cb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15, skipping insertion in model container [2023-11-29 00:23:15,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:23:15,748 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2023-11-29 00:23:15,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:23:15,788 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:23:15,800 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2023-11-29 00:23:15,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:23:15,826 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:23:15,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15 WrapperNode [2023-11-29 00:23:15,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:23:15,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:23:15,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:23:15,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:23:15,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,864 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2023-11-29 00:23:15,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:23:15,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:23:15,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:23:15,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:23:15,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,896 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 6, 6, 0]. 43 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2, 0]. The 5 writes are split as follows [0, 2, 3, 0]. [2023-11-29 00:23:15,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:23:15,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:23:15,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:23:15,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:23:15,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (1/1) ... [2023-11-29 00:23:15,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:23:15,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:23:15,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:23:15,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:23:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:23:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:23:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:23:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:23:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 00:23:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 00:23:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 00:23:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 00:23:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:23:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-29 00:23:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-29 00:23:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure g [2023-11-29 00:23:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2023-11-29 00:23:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:23:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:23:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:23:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:23:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2023-11-29 00:23:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2023-11-29 00:23:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:23:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:23:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:23:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:23:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:23:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:23:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:23:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:23:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:23:15,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:23:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:23:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:23:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:23:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:23:16,092 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:23:16,094 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:23:16,265 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:23:16,297 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:23:16,297 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 00:23:16,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:23:16 BoogieIcfgContainer [2023-11-29 00:23:16,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:23:16,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:23:16,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:23:16,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:23:16,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:23:15" (1/3) ... [2023-11-29 00:23:16,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677738b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:23:16, skipping insertion in model container [2023-11-29 00:23:16,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:23:15" (2/3) ... [2023-11-29 00:23:16,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677738b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:23:16, skipping insertion in model container [2023-11-29 00:23:16,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:23:16" (3/3) ... [2023-11-29 00:23:16,307 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2023-11-29 00:23:16,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:23:16,328 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:23:16,379 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:23:16,386 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f1d0247, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:23:16,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:23:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 00:23:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 00:23:16,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:16,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:16,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:16,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:16,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1004977553, now seen corresponding path program 1 times [2023-11-29 00:23:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129322684] [2023-11-29 00:23:16,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:23:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:23:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:16,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 00:23:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:16,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:23:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:23:16,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:16,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129322684] [2023-11-29 00:23:16,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129322684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:23:16,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:23:16,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:23:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603348582] [2023-11-29 00:23:16,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:23:16,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:23:16,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:23:16,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:23:16,719 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:23:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:23:16,890 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2023-11-29 00:23:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:23:16,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-11-29 00:23:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:23:16,902 INFO L225 Difference]: With dead ends: 73 [2023-11-29 00:23:16,902 INFO L226 Difference]: Without dead ends: 40 [2023-11-29 00:23:16,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:23:16,909 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:23:16,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 33 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:23:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-29 00:23:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2023-11-29 00:23:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:23:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-29 00:23:16,953 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2023-11-29 00:23:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:23:16,953 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-29 00:23:16,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:23:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-11-29 00:23:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 00:23:16,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:16,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:16,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:23:16,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:16,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash -796399061, now seen corresponding path program 1 times [2023-11-29 00:23:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:16,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277284445] [2023-11-29 00:23:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:23:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:23:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 00:23:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:23:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:23:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:17,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277284445] [2023-11-29 00:23:17,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277284445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:23:17,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:23:17,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:23:17,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144628027] [2023-11-29 00:23:17,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:23:17,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:23:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:23:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:23:17,108 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:23:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:23:17,257 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2023-11-29 00:23:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:23:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-11-29 00:23:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:23:17,259 INFO L225 Difference]: With dead ends: 68 [2023-11-29 00:23:17,260 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 00:23:17,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:23:17,262 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:23:17,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 35 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:23:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 00:23:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2023-11-29 00:23:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:23:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-11-29 00:23:17,273 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 28 [2023-11-29 00:23:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:23:17,274 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-11-29 00:23:17,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:23:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-11-29 00:23:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 00:23:17,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:17,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:17,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:23:17,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:17,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2139651666, now seen corresponding path program 1 times [2023-11-29 00:23:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:17,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959288789] [2023-11-29 00:23:17,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:17,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:23:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:23:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:23:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:23:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:23:17,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:17,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959288789] [2023-11-29 00:23:17,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959288789] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:23:17,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264546232] [2023-11-29 00:23:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:17,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:17,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:23:17,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:23:17,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:23:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:23:17,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:23:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:23:17,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:23:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264546232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:23:17,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:23:17,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 00:23:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317598836] [2023-11-29 00:23:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:23:17,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:23:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:17,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:23:17,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:23:17,600 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:23:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:23:17,627 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2023-11-29 00:23:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:23:17,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-11-29 00:23:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:23:17,629 INFO L225 Difference]: With dead ends: 52 [2023-11-29 00:23:17,629 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 00:23:17,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:23:17,631 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:23:17,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:23:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 00:23:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-11-29 00:23:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:23:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-11-29 00:23:17,640 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2023-11-29 00:23:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:23:17,641 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-11-29 00:23:17,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:23:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-11-29 00:23:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:23:17,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:17,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:17,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:23:17,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:17,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:17,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1629580944, now seen corresponding path program 1 times [2023-11-29 00:23:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:17,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897485571] [2023-11-29 00:23:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:23:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:23:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:23:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 00:23:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:23:17,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897485571] [2023-11-29 00:23:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897485571] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:23:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371528546] [2023-11-29 00:23:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:17,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:17,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:23:17,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:23:17,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:23:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:18,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:23:18,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:23:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:23:18,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:23:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:23:18,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371528546] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:23:18,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:23:18,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 7 [2023-11-29 00:23:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943267836] [2023-11-29 00:23:18,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:23:18,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:23:18,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:18,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:23:18,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:23:18,180 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 00:23:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:23:18,342 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2023-11-29 00:23:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:23:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 31 [2023-11-29 00:23:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:23:18,344 INFO L225 Difference]: With dead ends: 71 [2023-11-29 00:23:18,344 INFO L226 Difference]: Without dead ends: 43 [2023-11-29 00:23:18,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:23:18,346 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:23:18,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 37 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:23:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-29 00:23:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2023-11-29 00:23:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:23:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-11-29 00:23:18,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 31 [2023-11-29 00:23:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:23:18,354 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-11-29 00:23:18,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 00:23:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-11-29 00:23:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:23:18,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:18,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:18,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:23:18,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:18,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:18,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:18,562 INFO L85 PathProgramCache]: Analyzing trace with hash -751355927, now seen corresponding path program 2 times [2023-11-29 00:23:18,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:18,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035277104] [2023-11-29 00:23:18,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:18,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:23:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:23:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:18,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:23:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:23:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:23:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:19,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035277104] [2023-11-29 00:23:19,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035277104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:23:19,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:23:19,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:23:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269500449] [2023-11-29 00:23:19,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:23:19,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:23:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:19,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:23:19,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:23:19,003 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:23:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:23:19,609 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2023-11-29 00:23:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:23:19,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-11-29 00:23:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:23:19,612 INFO L225 Difference]: With dead ends: 84 [2023-11-29 00:23:19,612 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 00:23:19,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:23:19,614 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 132 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:23:19,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 58 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:23:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 00:23:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2023-11-29 00:23:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 45 states have internal predecessors, (57), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-11-29 00:23:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2023-11-29 00:23:19,629 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 32 [2023-11-29 00:23:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:23:19,630 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2023-11-29 00:23:19,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:23:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2023-11-29 00:23:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 00:23:19,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:19,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:19,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:23:19,632 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:19,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash -974269589, now seen corresponding path program 1 times [2023-11-29 00:23:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:19,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867634064] [2023-11-29 00:23:19,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:19,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:23:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:19,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:23:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:19,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:23:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 00:23:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:23:19,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:19,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867634064] [2023-11-29 00:23:19,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867634064] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:23:19,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912542398] [2023-11-29 00:23:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:19,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:19,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:23:19,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:23:19,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:23:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:19,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:23:19,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:23:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:23:19,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:23:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:23:19,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912542398] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:23:19,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:23:19,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-11-29 00:23:19,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453084325] [2023-11-29 00:23:19,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:23:19,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:23:19,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:19,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:23:19,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:23:19,904 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:23:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:23:20,096 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2023-11-29 00:23:20,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:23:20,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-11-29 00:23:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:23:20,098 INFO L225 Difference]: With dead ends: 109 [2023-11-29 00:23:20,099 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 00:23:20,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:23:20,100 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:23:20,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 40 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:23:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 00:23:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2023-11-29 00:23:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 47 states have internal predecessors, (59), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-11-29 00:23:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2023-11-29 00:23:20,115 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 34 [2023-11-29 00:23:20,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:23:20,116 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2023-11-29 00:23:20,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:23:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2023-11-29 00:23:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 00:23:20,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:20,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:20,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:23:20,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:20,323 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:20,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2135827361, now seen corresponding path program 1 times [2023-11-29 00:23:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159291588] [2023-11-29 00:23:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:23:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:23:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:20,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:23:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:23:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:23:20,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159291588] [2023-11-29 00:23:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159291588] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:23:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581345366] [2023-11-29 00:23:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:20,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:20,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:23:20,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:23:20,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:23:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:20,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 00:23:20,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:23:21,254 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 11 treesize of output 7 [2023-11-29 00:23:21,321 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 7 treesize of output 3 [2023-11-29 00:23:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:23:21,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:23:21,665 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 15 treesize of output 13 [2023-11-29 00:23:21,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 18 [2023-11-29 00:23:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:23:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581345366] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:23:21,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:23:21,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2023-11-29 00:23:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530463589] [2023-11-29 00:23:21,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:23:21,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 00:23:21,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 00:23:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 00:23:21,862 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 37 states, 32 states have (on average 1.78125) internal successors, (57), 26 states have internal predecessors, (57), 9 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-29 00:23:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:23:22,922 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2023-11-29 00:23:22,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:23:22,923 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 1.78125) internal successors, (57), 26 states have internal predecessors, (57), 9 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 35 [2023-11-29 00:23:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:23:22,924 INFO L225 Difference]: With dead ends: 131 [2023-11-29 00:23:22,924 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 00:23:22,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=356, Invalid=2400, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 00:23:22,927 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 260 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:23:22,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 103 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:23:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 00:23:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2023-11-29 00:23:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.328125) internal successors, (85), 68 states have internal predecessors, (85), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-29 00:23:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2023-11-29 00:23:22,945 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 35 [2023-11-29 00:23:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:23:22,946 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2023-11-29 00:23:22,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 1.78125) internal successors, (57), 26 states have internal predecessors, (57), 9 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-29 00:23:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2023-11-29 00:23:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 00:23:22,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:22,948 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:22,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 00:23:23,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 00:23:23,154 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:23,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1726055391, now seen corresponding path program 1 times [2023-11-29 00:23:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:23,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013270983] [2023-11-29 00:23:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:23,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:23:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:23:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:23:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:24,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:23:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:23:24,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013270983] [2023-11-29 00:23:24,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013270983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:23:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094524697] [2023-11-29 00:23:24,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:24,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:24,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:23:24,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:23:24,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:23:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:24,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 00:23:24,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:23:24,855 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 11 treesize of output 7 [2023-11-29 00:23:24,940 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 7 treesize of output 3 [2023-11-29 00:23:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:23:25,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:23:25,516 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 17 treesize of output 15 [2023-11-29 00:23:25,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-29 00:23:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:23:25,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094524697] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:23:25,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:23:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 16] total 53 [2023-11-29 00:23:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355739532] [2023-11-29 00:23:25,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:23:25,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-29 00:23:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:25,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-29 00:23:25,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 00:23:25,786 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 53 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 39 states have internal predecessors, (71), 11 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 00:23:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:23:30,238 INFO L93 Difference]: Finished difference Result 291 states and 376 transitions. [2023-11-29 00:23:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-29 00:23:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 39 states have internal predecessors, (71), 11 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 36 [2023-11-29 00:23:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:23:30,242 INFO L225 Difference]: With dead ends: 291 [2023-11-29 00:23:30,242 INFO L226 Difference]: Without dead ends: 265 [2023-11-29 00:23:30,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3031 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1426, Invalid=11914, Unknown=0, NotChecked=0, Total=13340 [2023-11-29 00:23:30,248 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 515 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:23:30,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 126 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 00:23:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-29 00:23:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 184. [2023-11-29 00:23:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 16 states have call predecessors, (20), 23 states have return successors, (32), 19 states have call predecessors, (32), 13 states have call successors, (32) [2023-11-29 00:23:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2023-11-29 00:23:30,281 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 36 [2023-11-29 00:23:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:23:30,281 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2023-11-29 00:23:30,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 39 states have internal predecessors, (71), 11 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 00:23:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2023-11-29 00:23:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 00:23:30,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:30,284 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:30,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:23:30,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:30,486 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:30,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash -825822554, now seen corresponding path program 1 times [2023-11-29 00:23:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:30,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305539796] [2023-11-29 00:23:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:23:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:23:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:23:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:23:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:23:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305539796] [2023-11-29 00:23:31,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305539796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:23:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430806135] [2023-11-29 00:23:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:31,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:31,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:23:31,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:23:31,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:23:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:31,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 00:23:31,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:23:31,638 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 11 treesize of output 7 [2023-11-29 00:23:31,668 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 7 treesize of output 3 [2023-11-29 00:23:31,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:23:31,807 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 21 treesize of output 20 [2023-11-29 00:23:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:23:32,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:23:32,368 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 16 treesize of output 14 [2023-11-29 00:23:32,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2023-11-29 00:23:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:23:32,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430806135] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:23:32,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:23:32,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 10] total 37 [2023-11-29 00:23:32,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282268658] [2023-11-29 00:23:32,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:23:32,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 00:23:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:32,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 00:23:32,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1197, Unknown=6, NotChecked=0, Total=1332 [2023-11-29 00:23:32,421 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand has 37 states, 34 states have (on average 2.176470588235294) internal successors, (74), 30 states have internal predecessors, (74), 10 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-29 00:23:42,373 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 [0] [2023-11-29 00:23:46,381 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 [0] [2023-11-29 00:23:51,062 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 [0] [2023-11-29 00:23:55,083 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 [0] [2023-11-29 00:23:59,153 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 [0] [2023-11-29 00:24:07,230 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 [0] [2023-11-29 00:24:19,485 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 [0] [2023-11-29 00:24:23,526 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 [0] [2023-11-29 00:24:27,651 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 [0] [2023-11-29 00:24:31,673 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 [0] [2023-11-29 00:24:39,756 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 [0] [2023-11-29 00:24:43,772 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 [0] [2023-11-29 00:24:47,818 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 [0] [2023-11-29 00:24:51,843 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 [0] [2023-11-29 00:24:55,866 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 [0] [2023-11-29 00:24:59,886 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 [0] [2023-11-29 00:25:03,898 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 [0] [2023-11-29 00:25:07,902 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 [0] [2023-11-29 00:25:16,059 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 [0] [2023-11-29 00:25:20,069 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 [0] [2023-11-29 00:25:24,090 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 [0] [2023-11-29 00:25:28,095 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 [0] [2023-11-29 00:25:32,100 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 [0] [2023-11-29 00:25:36,159 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 [0] [2023-11-29 00:25:40,182 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 [0] [2023-11-29 00:25:44,202 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 [0] [2023-11-29 00:25:48,207 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 [0] [2023-11-29 00:25:56,269 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 [0] [2023-11-29 00:26:00,273 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 [0] [2023-11-29 00:26:04,278 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 [0] [2023-11-29 00:26:12,334 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 [0] [2023-11-29 00:26:16,466 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 [0] [2023-11-29 00:26:20,509 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 [0] [2023-11-29 00:26:24,517 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 [0] [2023-11-29 00:26:28,522 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 [0] [2023-11-29 00:26:32,527 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 [0] [2023-11-29 00:26:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:32,709 INFO L93 Difference]: Finished difference Result 427 states and 558 transitions. [2023-11-29 00:26:32,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-11-29 00:26:32,711 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.176470588235294) internal successors, (74), 30 states have internal predecessors, (74), 10 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 37 [2023-11-29 00:26:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:32,714 INFO L225 Difference]: With dead ends: 427 [2023-11-29 00:26:32,714 INFO L226 Difference]: Without dead ends: 353 [2023-11-29 00:26:32,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=1000, Invalid=6638, Unknown=18, NotChecked=0, Total=7656 [2023-11-29 00:26:32,718 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 462 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 127 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:32,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 86 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1606 Invalid, 53 Unknown, 0 Unchecked, 146.1s Time] [2023-11-29 00:26:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-11-29 00:26:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 256. [2023-11-29 00:26:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 194 states have (on average 1.402061855670103) internal successors, (272), 209 states have internal predecessors, (272), 28 states have call successors, (28), 19 states have call predecessors, (28), 33 states have return successors, (49), 27 states have call predecessors, (49), 18 states have call successors, (49) [2023-11-29 00:26:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 349 transitions. [2023-11-29 00:26:32,763 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 349 transitions. Word has length 37 [2023-11-29 00:26:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:32,763 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 349 transitions. [2023-11-29 00:26:32,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.176470588235294) internal successors, (74), 30 states have internal predecessors, (74), 10 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-29 00:26:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 349 transitions. [2023-11-29 00:26:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 00:26:32,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:32,766 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:32,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:26:32,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:32,970 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:32,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1113607788, now seen corresponding path program 1 times [2023-11-29 00:26:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819265031] [2023-11-29 00:26:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:26:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:26:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:26:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819265031] [2023-11-29 00:26:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819265031] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115269090] [2023-11-29 00:26:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:33,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:33,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:33,717 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:33,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:26:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 00:26:33,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:33,875 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 11 treesize of output 7 [2023-11-29 00:26:34,085 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 7 treesize of output 3 [2023-11-29 00:26:34,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:26:34,213 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 27 treesize of output 11 [2023-11-29 00:26:34,223 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 7 treesize of output 3 [2023-11-29 00:26:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:26:34,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:35,160 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 17 treesize of output 15 [2023-11-29 00:26:35,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-29 00:26:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:26:35,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115269090] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:35,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:26:35,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 15] total 47 [2023-11-29 00:26:35,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769839729] [2023-11-29 00:26:35,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:35,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-29 00:26:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:35,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-29 00:26:35,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2000, Unknown=15, NotChecked=0, Total=2162 [2023-11-29 00:26:35,248 INFO L87 Difference]: Start difference. First operand 256 states and 349 transitions. Second operand has 47 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 38 states have internal predecessors, (79), 7 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-29 00:26:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:37,427 INFO L93 Difference]: Finished difference Result 342 states and 450 transitions. [2023-11-29 00:26:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 00:26:37,428 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 38 states have internal predecessors, (79), 7 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 38 [2023-11-29 00:26:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:37,430 INFO L225 Difference]: With dead ends: 342 [2023-11-29 00:26:37,430 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 00:26:37,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=471, Invalid=4626, Unknown=15, NotChecked=0, Total=5112 [2023-11-29 00:26:37,432 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 135 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 47 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:37,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 124 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1332 Invalid, 8 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:26:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 00:26:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2023-11-29 00:26:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 113 states have internal predecessors, (148), 14 states have call successors, (14), 11 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2023-11-29 00:26:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 175 transitions. [2023-11-29 00:26:37,455 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 175 transitions. Word has length 38 [2023-11-29 00:26:37,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:37,455 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 175 transitions. [2023-11-29 00:26:37,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 38 states have internal predecessors, (79), 7 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-29 00:26:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2023-11-29 00:26:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 00:26:37,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:37,457 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:37,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:26:37,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 00:26:37,658 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:37,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1170195115, now seen corresponding path program 2 times [2023-11-29 00:26:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:37,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212499086] [2023-11-29 00:26:37,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:26:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:26:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:26:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:26:37,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:37,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212499086] [2023-11-29 00:26:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212499086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:37,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:37,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:26:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451525327] [2023-11-29 00:26:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:37,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:26:37,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:37,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:26:37,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:26:37,778 INFO L87 Difference]: Start difference. First operand 138 states and 175 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:26:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:37,964 INFO L93 Difference]: Finished difference Result 177 states and 222 transitions. [2023-11-29 00:26:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:26:37,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-11-29 00:26:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:37,965 INFO L225 Difference]: With dead ends: 177 [2023-11-29 00:26:37,966 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 00:26:37,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:26:37,967 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 50 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:37,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 39 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 00:26:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2023-11-29 00:26:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2625) internal successors, (101), 82 states have internal predecessors, (101), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-29 00:26:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2023-11-29 00:26:37,980 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 40 [2023-11-29 00:26:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:37,980 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2023-11-29 00:26:37,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:26:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2023-11-29 00:26:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 00:26:37,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:37,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:37,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:26:37,981 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:37,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash -735499196, now seen corresponding path program 2 times [2023-11-29 00:26:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:37,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413246205] [2023-11-29 00:26:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:26:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:26:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 00:26:38,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413246205] [2023-11-29 00:26:38,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413246205] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391256063] [2023-11-29 00:26:38,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:26:38,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:38,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:38,089 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:38,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:26:38,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:26:38,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:26:38,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:26:38,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 00:26:38,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:26:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391256063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:38,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:26:38,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-11-29 00:26:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824219514] [2023-11-29 00:26:38,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:38,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:26:38,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:38,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:26:38,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:26:38,253 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:26:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:38,296 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2023-11-29 00:26:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:26:38,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-11-29 00:26:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:38,298 INFO L225 Difference]: With dead ends: 170 [2023-11-29 00:26:38,298 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 00:26:38,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:26:38,299 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:38,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:26:38,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 00:26:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-11-29 00:26:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 77 states have internal predecessors, (88), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 00:26:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2023-11-29 00:26:38,317 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 40 [2023-11-29 00:26:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:38,317 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2023-11-29 00:26:38,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:26:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2023-11-29 00:26:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:26:38,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:38,319 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:38,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 00:26:38,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 00:26:38,519 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:38,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash 81462299, now seen corresponding path program 1 times [2023-11-29 00:26:38,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061368378] [2023-11-29 00:26:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:38,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:26:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:26:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:26:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 00:26:38,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:38,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061368378] [2023-11-29 00:26:38,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061368378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:38,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498608531] [2023-11-29 00:26:38,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:38,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:38,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:38,631 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:38,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:26:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:38,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:26:38,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 00:26:38,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 00:26:38,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498608531] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:38,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:26:38,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 7 [2023-11-29 00:26:38,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385507428] [2023-11-29 00:26:38,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:38,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:26:38,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:38,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:26:38,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:26:38,823 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 00:26:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:39,002 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2023-11-29 00:26:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:26:39,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2023-11-29 00:26:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:39,003 INFO L225 Difference]: With dead ends: 122 [2023-11-29 00:26:39,003 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 00:26:39,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:26:39,004 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 86 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:39,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 49 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 00:26:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2023-11-29 00:26:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 77 states have internal predecessors, (86), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 00:26:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2023-11-29 00:26:39,017 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 44 [2023-11-29 00:26:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:39,017 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2023-11-29 00:26:39,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 00:26:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2023-11-29 00:26:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 00:26:39,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:39,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:39,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:26:39,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:39,219 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:39,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash 523876967, now seen corresponding path program 1 times [2023-11-29 00:26:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:39,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735424564] [2023-11-29 00:26:39,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:26:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:26:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:26:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 00:26:40,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:40,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735424564] [2023-11-29 00:26:40,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735424564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:40,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858021629] [2023-11-29 00:26:40,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:40,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:40,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:40,223 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:40,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:26:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-29 00:26:40,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:26:40,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:40,890 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 17 treesize of output 9 [2023-11-29 00:26:40,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:26:40,988 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 20 treesize of output 16 [2023-11-29 00:26:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 00:26:41,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858021629] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:41,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:26:41,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 41 [2023-11-29 00:26:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862760032] [2023-11-29 00:26:41,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:41,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 00:26:41,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 00:26:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1518, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 00:26:41,167 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 41 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 29 states have internal predecessors, (77), 8 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2023-11-29 00:26:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:42,644 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2023-11-29 00:26:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 00:26:42,645 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 29 states have internal predecessors, (77), 8 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 47 [2023-11-29 00:26:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:42,645 INFO L225 Difference]: With dead ends: 112 [2023-11-29 00:26:42,646 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 00:26:42,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=440, Invalid=3592, Unknown=0, NotChecked=0, Total=4032 [2023-11-29 00:26:42,648 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 188 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:42,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 102 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:26:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 00:26:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2023-11-29 00:26:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 00:26:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-11-29 00:26:42,666 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 47 [2023-11-29 00:26:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:42,666 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-11-29 00:26:42,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 29 states have internal predecessors, (77), 8 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2023-11-29 00:26:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-11-29 00:26:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 00:26:42,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:42,667 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:42,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 00:26:42,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 00:26:42,868 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:42,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash -681727901, now seen corresponding path program 2 times [2023-11-29 00:26:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:42,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452449022] [2023-11-29 00:26:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:42,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:43,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:26:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:26:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:43,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:26:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:26:43,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:43,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452449022] [2023-11-29 00:26:43,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452449022] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501958065] [2023-11-29 00:26:43,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:26:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:43,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:43,485 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:43,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 00:26:43,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:26:43,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:26:43,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 00:26:43,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:43,735 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 11 treesize of output 7 [2023-11-29 00:26:43,755 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 7 treesize of output 3 [2023-11-29 00:26:43,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:26:43,909 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 27 treesize of output 11 [2023-11-29 00:26:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 16 refuted. 5 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:26:43,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:44,261 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 16 treesize of output 14 [2023-11-29 00:26:44,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2023-11-29 00:26:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:26:44,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501958065] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:44,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:26:44,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 30 [2023-11-29 00:26:44,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385615663] [2023-11-29 00:26:44,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:44,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 00:26:44,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 00:26:44,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=746, Unknown=5, NotChecked=0, Total=870 [2023-11-29 00:26:44,292 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 26 states have internal predecessors, (91), 4 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-29 00:26:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:45,265 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2023-11-29 00:26:45,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 00:26:45,265 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 26 states have internal predecessors, (91), 4 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 50 [2023-11-29 00:26:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:45,266 INFO L225 Difference]: With dead ends: 107 [2023-11-29 00:26:45,266 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 00:26:45,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=486, Invalid=2161, Unknown=5, NotChecked=0, Total=2652 [2023-11-29 00:26:45,268 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 164 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:45,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 108 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:26:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 00:26:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2023-11-29 00:26:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 00:26:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2023-11-29 00:26:45,279 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 50 [2023-11-29 00:26:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:45,279 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2023-11-29 00:26:45,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 26 states have internal predecessors, (91), 4 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-29 00:26:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2023-11-29 00:26:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 00:26:45,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:45,280 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:45,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 00:26:45,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:45,481 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:45,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1771141427, now seen corresponding path program 3 times [2023-11-29 00:26:45,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:45,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458241258] [2023-11-29 00:26:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:26:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:46,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:26:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:46,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:46,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:26:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:26:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458241258] [2023-11-29 00:26:46,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458241258] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904880391] [2023-11-29 00:26:46,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:26:46,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:46,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:46,708 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:46,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 00:26:47,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 00:26:47,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:26:47,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-29 00:26:47,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:47,485 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 11 treesize of output 7 [2023-11-29 00:26:47,489 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 11 treesize of output 7 [2023-11-29 00:26:47,579 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 7 treesize of output 3 [2023-11-29 00:26:47,584 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 7 treesize of output 3 [2023-11-29 00:26:47,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:26:47,796 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 27 treesize of output 11 [2023-11-29 00:26:47,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:26:47,802 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 27 treesize of output 11 [2023-11-29 00:26:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:26:48,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904880391] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:48,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:26:48,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2023-11-29 00:26:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001872414] [2023-11-29 00:26:48,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:48,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 00:26:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:48,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 00:26:48,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1720, Unknown=7, NotChecked=0, Total=1892 [2023-11-29 00:26:48,572 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 43 states, 36 states have (on average 1.75) internal successors, (63), 30 states have internal predecessors, (63), 8 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-29 00:26:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:50,705 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2023-11-29 00:26:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 00:26:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 1.75) internal successors, (63), 30 states have internal predecessors, (63), 8 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 50 [2023-11-29 00:26:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:50,707 INFO L225 Difference]: With dead ends: 108 [2023-11-29 00:26:50,707 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 00:26:50,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=674, Invalid=4721, Unknown=7, NotChecked=0, Total=5402 [2023-11-29 00:26:50,710 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 273 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 53 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:50,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 74 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1275 Invalid, 9 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:26:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 00:26:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2023-11-29 00:26:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.032258064516129) internal successors, (64), 63 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 00:26:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2023-11-29 00:26:50,726 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 50 [2023-11-29 00:26:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:50,727 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2023-11-29 00:26:50,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 1.75) internal successors, (63), 30 states have internal predecessors, (63), 8 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-29 00:26:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2023-11-29 00:26:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 00:26:50,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:50,728 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:50,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-29 00:26:50,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 00:26:50,928 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:50,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1769088504, now seen corresponding path program 4 times [2023-11-29 00:26:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326812568] [2023-11-29 00:26:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:26:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:26:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:26:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:26:52,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:52,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326812568] [2023-11-29 00:26:52,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326812568] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:52,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570528006] [2023-11-29 00:26:52,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:26:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:52,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:52,685 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:52,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 00:26:52,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:26:52,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:26:52,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 00:26:52,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:53,205 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 [2023-11-29 00:26:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:26:53,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:53,966 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 16 [2023-11-29 00:26:53,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2023-11-29 00:26:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:26:54,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570528006] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:54,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:26:54,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 17, 17] total 49 [2023-11-29 00:26:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577260877] [2023-11-29 00:26:54,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:54,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-29 00:26:54,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:54,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-29 00:26:54,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2222, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 00:26:54,203 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 49 states, 40 states have (on average 2.1) internal successors, (84), 38 states have internal predecessors, (84), 10 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-29 00:26:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:56,858 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2023-11-29 00:26:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 00:26:56,859 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 2.1) internal successors, (84), 38 states have internal predecessors, (84), 10 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) Word has length 52 [2023-11-29 00:26:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:56,859 INFO L225 Difference]: With dead ends: 89 [2023-11-29 00:26:56,859 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 00:26:56,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 84 SyntacticMatches, 9 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=512, Invalid=5650, Unknown=0, NotChecked=0, Total=6162 [2023-11-29 00:26:56,863 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 211 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:56,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 100 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:26:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 00:26:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 00:26:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:26:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2023-11-29 00:26:56,876 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2023-11-29 00:26:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:56,876 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2023-11-29 00:26:56,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 2.1) internal successors, (84), 38 states have internal predecessors, (84), 10 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-29 00:26:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2023-11-29 00:26:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 00:26:56,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:56,877 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:56,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 00:26:57,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:57,078 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:57,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1552570588, now seen corresponding path program 1 times [2023-11-29 00:26:57,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:57,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134859721] [2023-11-29 00:26:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:57,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:26:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:26:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:26:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 00:26:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 00:26:57,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:57,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134859721] [2023-11-29 00:26:57,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134859721] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:57,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046489599] [2023-11-29 00:26:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:57,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:57,985 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:57,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 00:26:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:58,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 00:26:58,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:58,456 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 11 treesize of output 7 [2023-11-29 00:26:58,524 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 7 treesize of output 3 [2023-11-29 00:26:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 00:26:58,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:59,120 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 16 treesize of output 14 [2023-11-29 00:26:59,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 16 [2023-11-29 00:26:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:26:59,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046489599] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:59,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:26:59,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 18] total 54 [2023-11-29 00:26:59,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912362404] [2023-11-29 00:26:59,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:59,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-29 00:26:59,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:59,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 00:26:59,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2672, Unknown=0, NotChecked=0, Total=2862 [2023-11-29 00:26:59,419 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 54 states, 43 states have (on average 2.186046511627907) internal successors, (94), 37 states have internal predecessors, (94), 11 states have call successors, (18), 12 states have call predecessors, (18), 13 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-29 00:27:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:00,744 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2023-11-29 00:27:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:27:00,745 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 43 states have (on average 2.186046511627907) internal successors, (94), 37 states have internal predecessors, (94), 11 states have call successors, (18), 12 states have call predecessors, (18), 13 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) Word has length 53 [2023-11-29 00:27:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:00,745 INFO L225 Difference]: With dead ends: 54 [2023-11-29 00:27:00,745 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:27:00,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=458, Invalid=4654, Unknown=0, NotChecked=0, Total=5112 [2023-11-29 00:27:00,747 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 103 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:00,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 108 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:27:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:27:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:27:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:27:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:27:00,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2023-11-29 00:27:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:00,748 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:27:00,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 43 states have (on average 2.186046511627907) internal successors, (94), 37 states have internal predecessors, (94), 11 states have call successors, (18), 12 states have call predecessors, (18), 13 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-29 00:27:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:27:00,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:27:00,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:27:00,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-29 00:27:00,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:27:00,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:27:03,781 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 48 51) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (or (= ~counter~0 |old(~counter~0)|) (not (= |~#pstate~0.offset| 0)) (not (= |~#pp~0.offset| 0)) (not (= (select .cse0 0) 0)) (not (= (select .cse0 4) 0)) (not (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0)) (= |old(~counter~0)| 0))) [2023-11-29 00:27:03,782 INFO L899 garLoopResultBuilder]: For program point fake_mallocEXIT(lines 48 51) no Hoare annotation was computed. [2023-11-29 00:27:03,782 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2023-11-29 00:27:03,782 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse22 (select |old(#memory_$Pointer$#1.offset)| |~#pp~0.base|))) (let ((.cse2 (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|)) (.cse11 (= f_~pointer.base |f_#in~pointer.base|)) (.cse3 (= |#memory_int#2| |old(#memory_int#2)|)) (.cse4 (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|)) (.cse5 (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|)) (.cse6 (= |#memory_int#1| |old(#memory_int#1)|)) (.cse7 (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) (.cse8 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse14 (select .cse22 4)) (.cse21 (select |old(#memory_$Pointer$#1.base)| |~#pp~0.base|)) (.cse12 (select |#memory_$Pointer$#1.base| |~#pp~0.base|)) (.cse20 (select .cse22 0))) (let ((.cse1 (not (= .cse20 0))) (.cse13 (not (= (select .cse12 0) 0))) (.cse15 (= (select .cse21 0) 0)) (.cse0 (not (= |~#pstate~0.offset| 0))) (.cse9 (not (= |~#pp~0.offset| 0))) (.cse18 (not (= (select .cse21 4) 0))) (.cse19 (not (= .cse14 0))) (.cse17 (and .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 (= f_~i~1 0) .cse7 .cse8)) (.cse16 (select |old(#memory_int#2)| |~#pstate~0.base|)) (.cse10 (= f_~i~1 1))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 f_~i~1)) .cse9 (and .cse10 .cse2 (or .cse11 (= f_~pointer.base (select .cse12 4))) .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (not (= .cse14 1)) (and (= |f_#in~pointer.base| 0) .cse15) (not (= (select .cse16 4) 1)) .cse17) (or .cse0 .cse1 (and .cse10 (or .cse11 (= f_~pointer.base 0)) .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) .cse9 .cse18 .cse19 .cse17) (or (not .cse15) .cse0 .cse9 (not (= .cse20 1)) .cse18 .cse19 .cse17 (not (= (select .cse16 0) 1)) (and .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))))) [2023-11-29 00:27:03,782 INFO L899 garLoopResultBuilder]: For program point L27-4(lines 25 34) no Hoare annotation was computed. [2023-11-29 00:27:03,782 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 25 34) the Hoare annotation is: (let ((.cse11 (select |old(#memory_$Pointer$#1.offset)| |~#pp~0.base|))) (let ((.cse3 (select .cse11 0)) (.cse9 (select .cse11 4)) (.cse10 (select |old(#memory_$Pointer$#1.base)| |~#pp~0.base|))) (let ((.cse4 (not (= (select .cse10 4) 0))) (.cse6 (not (= .cse9 0))) (.cse1 (not (= |~#pstate~0.offset| 0))) (.cse8 (not (= .cse3 0))) (.cse2 (not (= |~#pp~0.offset| 0))) (.cse0 (= (select .cse10 0) 0)) (.cse5 (and (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|))) (.cse7 (select |old(#memory_int#2)| |~#pstate~0.base|))) (and (or (not .cse0) .cse1 .cse2 (not (= .cse3 1)) .cse4 .cse5 .cse6 (not (= (select .cse7 0) 1))) (or .cse1 .cse8 .cse2 .cse4 .cse5 .cse6) (or .cse1 .cse8 .cse2 (not (= .cse9 1)) (and (= |f_#in~pointer.base| 0) .cse0) .cse5 (not (= (select .cse7 4) 1))))))) [2023-11-29 00:27:03,782 INFO L899 garLoopResultBuilder]: For program point fEXIT(lines 25 34) no Hoare annotation was computed. [2023-11-29 00:27:03,782 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 36 45) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse14 (select .cse1 0)) (.cse15 (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 0))) (let ((.cse13 (select |old(#memory_int#2)| |~#pstate~0.base|)) (.cse10 (= |f_#in~pointer.base| 0)) (.cse11 (= .cse15 0)) (.cse12 (= .cse14 0))) (let ((.cse5 (not .cse12)) (.cse6 (and .cse10 .cse11)) (.cse7 (= .cse15 |g_#in~pointer#1.base|)) (.cse3 (not (= |~#pstate~0.offset| 0))) (.cse0 (and (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|))) (.cse4 (not (= |~#pp~0.offset| 0))) (.cse2 (not (= 2 |g_#in~pointer#1.offset|))) (.cse9 (not (= (select .cse13 4) 1))) (.cse8 (not (= .cse14 1)))) (and (or .cse0 (not (= (select .cse1 4) 1)) .cse2 (and (or .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse3 .cse4 .cse8))) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse9 .cse7) (or .cse3 .cse0 .cse4 .cse9 (and .cse10 .cse11 .cse12) (not (= (select .cse13 0) 1))) (or .cse3 .cse0 .cse4 .cse2 .cse9 .cse8)))))) [2023-11-29 00:27:03,783 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2023-11-29 00:27:03,783 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse37 (select |#memory_$Pointer$#1.base| |~#pp~0.base|)) (.cse35 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse27 (select .cse35 0)) (.cse39 (select .cse37 0))) (let ((.cse20 (= .cse39 0)) (.cse21 (= .cse27 0)) (.cse28 (select .cse35 4)) (.cse25 (select |old(#memory_int#2)| |~#pstate~0.base|)) (.cse16 (select |#memory_int#2| |~#pstate~0.base|))) (let ((.cse41 (select .cse16 4)) (.cse40 (select .cse25 4)) (.cse31 (= .cse28 1)) (.cse12 (not .cse21)) (.cse33 (not .cse20)) (.cse19 (= |f_#in~pointer.base| 0)) (.cse43 (= |~#pstate~0.offset| 0)) (.cse29 (<= 2 |g_~i~2#1|)) (.cse42 (= |~#pp~0.offset| 0))) (let ((.cse22 (not (= (select .cse25 0) 1))) (.cse6 (= |g_~pointer#1.offset| 2)) (.cse1 (and (or .cse12 .cse33 (not .cse19)) .cse43 .cse29 .cse42)) (.cse7 (not (= 2 |g_#in~pointer#1.offset|))) (.cse15 (not (= .cse27 1))) (.cse17 (<= 1 |g_~i~2#1|)) (.cse8 (= |g_~i~2#1| 0)) (.cse9 (= |g_~pointer#1.base| |g_#in~pointer#1.base|)) (.cse10 (not .cse43)) (.cse11 (not .cse42)) (.cse0 (not .cse31)) (.cse24 (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|)) (.cse5 (= |g_~i~2#1| 1)) (.cse13 (and .cse19 .cse20)) (.cse18 (not (= .cse40 1))) (.cse2 (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|)) (.cse3 (= |#memory_int#2| |old(#memory_int#2)|)) (.cse4 (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|)) (.cse30 (= 2 .cse41)) (.cse32 (= .cse40 .cse41)) (.cse14 (= .cse39 |g_#in~pointer#1.base|))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 (and .cse2 .cse8 .cse3 .cse4 .cse6 .cse9) (and (or .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse10 .cse11 .cse15))) (or (and (= (select .cse16 (* |g_~i~2#1| 4)) 1) .cse17) .cse10 .cse11 (and .cse2 .cse8 .cse3 .cse4) .cse1 .cse18 (and .cse19 .cse20 .cse21) .cse22) (let ((.cse23 (= |g_~pointer#1.offset| 1))) (or (and .cse3 .cse23 .cse9) .cse10 .cse11 (and .cse24 .cse5 (exists ((v_subst_7 Int)) (and (= |#memory_int#2| (store |old(#memory_int#2)| |~#pstate~0.base| (let ((.cse26 (* 4 v_subst_7))) (store .cse25 .cse26 (select .cse16 .cse26))))) (<= v_subst_7 0)))) (not (= .cse27 |g_#in~pointer#1.offset|)) (and (<= .cse28 1) .cse29 (or (and .cse30 .cse31) .cse32)) .cse33 .cse18 .cse15 (and .cse29 .cse23 (exists ((|g_~i~2#1| Int)) (let ((.cse36 (* |g_~i~2#1| 4))) (let ((.cse34 (select .cse37 .cse36))) (and (= .cse34 |g_#in~pointer#1.base|) (= (select .cse35 .cse36) |g_#in~pointer#1.offset|) (not (= .cse34 0)))))) .cse9) (and .cse29 (exists ((v_subst_9 Int)) (and (<= v_subst_9 0) (= |#memory_int#2| (store |old(#memory_int#2)| |~#pstate~0.base| (let ((.cse38 (* 4 v_subst_9))) (store .cse25 .cse38 (select .cse16 .cse38)))))))) .cse22)) (or .cse10 .cse11 (and .cse2 .cse8 .cse3 .cse4 .cse6) .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse7 .cse18 .cse15) (or .cse10 (and .cse2 .cse8 (not (= .cse39 |g_~pointer#1.base|)) .cse3 .cse4) .cse11 .cse12 .cse29 (and .cse2 .cse3 .cse4 .cse17) .cse13 .cse18 .cse14) (or (and .cse8 .cse24 .cse9) .cse10 .cse11 .cse12 .cse0 (and .cse24 .cse5) .cse13 .cse18 (and .cse2 .cse29 .cse3 .cse4) (and .cse29 (<= 1 |g_#in~pointer#1.offset|) (or (and (= |g_#in~pointer#1.offset| 1) .cse30) .cse32)) .cse14))))))) [2023-11-29 00:27:03,783 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 36 45) no Hoare annotation was computed. [2023-11-29 00:27:03,783 INFO L899 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-11-29 00:27:03,783 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-11-29 00:27:03,783 INFO L899 garLoopResultBuilder]: For program point gEXIT(lines 36 45) no Hoare annotation was computed. [2023-11-29 00:27:03,783 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-11-29 00:27:03,783 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-29 00:27:03,783 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2023-11-29 00:27:03,783 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:27:03,784 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse12 (select .cse11 0)) (.cse9 (select |#memory_int#2| |~#pstate~0.base|))) (let ((.cse2 (= (select .cse9 4) 1)) (.cse0 (= |ULTIMATE.start_main_~a~0#1.base| 0)) (.cse8 (= .cse12 0)) (.cse10 (not (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 0) 0))) (.cse7 (= .cse12 1)) (.cse1 (= |~#pstate~0.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~b~0#1.offset| 2)) (.cse4 (= |~#pp~0.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~a~0#1.offset| 1)) (.cse6 (= |ULTIMATE.start_main_~b~0#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~counter~0 1)) .cse6 .cse7) (and .cse0 .cse1 (not .cse8) .cse2 (= (select .cse9 0) 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse10 .cse4 .cse5 .cse6) (and (<= 2 ~counter~0) .cse0 (or (and .cse8 .cse10) .cse7) .cse1 .cse3 .cse4 .cse5 (= (select .cse11 4) 1) .cse6))))) [2023-11-29 00:27:03,784 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (and (<= 2 ~counter~0) (= (select .cse0 4) 0) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= |~#pstate~0.offset| 0) (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= (select .cse0 0) 0) (= |~#pp~0.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= |ULTIMATE.start_main_~b~0#1.base| 0))) [2023-11-29 00:27:03,784 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$#1.base| |~#pp~0.base|)) (.cse12 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse0 (<= 2 ~counter~0)) (.cse9 (select .cse12 4)) (.cse1 (= |ULTIMATE.start_main_~a~0#1.base| 0)) (.cse2 (= |~#pstate~0.offset| 0)) (.cse3 (select |#memory_int#2| |~#pstate~0.base|)) (.cse6 (= (select .cse11 0) 0)) (.cse4 (= |ULTIMATE.start_main_~b~0#1.offset| 2)) (.cse7 (= |~#pp~0.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~a~0#1.offset| 1)) (.cse10 (= |ULTIMATE.start_main_~b~0#1.base| 0)) (.cse5 (select .cse12 0))) (or (and .cse0 .cse1 .cse2 (= (select .cse3 4) 1) .cse4 (= .cse5 0) (not .cse6) .cse7 .cse8 (= .cse9 1) .cse10) (and .cse0 (= .cse9 0) .cse1 .cse2 (= (select .cse11 4) 0) (= (select .cse3 0) 1) .cse6 .cse4 .cse7 .cse8 .cse10 (= .cse5 1))))) [2023-11-29 00:27:03,784 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (and (= (select .cse0 4) 0) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= |~#pstate~0.offset| 0) (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0) (= (select .cse0 0) 0) (= |~#pp~0.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= ~counter~0 2))) [2023-11-29 00:27:03,784 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-11-29 00:27:03,784 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-11-29 00:27:03,784 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse0 (= (select .cse6 4) 0)) (.cse1 (= |~#pstate~0.offset| 0)) (.cse2 (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0)) (.cse3 (= (select .cse6 0) 0)) (.cse4 (= |~#pp~0.offset| 0)) (.cse5 (= ~counter~0 1))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_init_~i~0#1| 0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_init_~i~0#1|) .cse4 .cse5)))) [2023-11-29 00:27:03,784 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:27:03,784 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 53 71) no Hoare annotation was computed. [2023-11-29 00:27:03,784 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse11 (select |#memory_int#2| |~#pstate~0.base|)) (.cse12 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (let ((.cse0 (<= 2 ~counter~0)) (.cse1 (= |ULTIMATE.start_main_~a~0#1.base| 0)) (.cse2 (= |~#pstate~0.offset| 0)) (.cse9 (select .cse12 4)) (.cse3 (= (select .cse11 4) 1)) (.cse6 (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 0) 0)) (.cse4 (= |ULTIMATE.start_main_~b~0#1.offset| 2)) (.cse7 (= |~#pp~0.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~a~0#1.offset| 1)) (.cse10 (= |ULTIMATE.start_main_~b~0#1.base| 0)) (.cse5 (select .cse12 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 0) (not .cse6) .cse7 .cse8 (= .cse9 1) .cse10) (and .cse0 .cse1 .cse2 (= .cse9 2) .cse3 (= (select .cse11 0) 1) .cse6 .cse4 .cse7 .cse8 .cse10 (= .cse5 1))))) [2023-11-29 00:27:03,784 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2023-11-29 00:27:03,784 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.offset| |~#pp~0.base|))) (and (= (select .cse0 4) 0) (= |~#pstate~0.offset| 0) (= (select (select |#memory_$Pointer$#1.base| |~#pp~0.base|) 4) 0) (= (select .cse0 0) 0) (= |~#pp~0.offset| 0) (= ~counter~0 1))) [2023-11-29 00:27:03,785 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2023-11-29 00:27:03,785 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-11-29 00:27:03,787 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:03,788 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:27:03,804 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,806 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,806 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,807 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,807 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,807 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,808 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,808 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,808 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,808 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,808 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,808 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,809 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,809 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,809 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,809 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][~i~2 * 4] could not be translated [2023-11-29 00:27:03,809 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,810 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,810 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,810 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,810 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,810 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,811 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,811 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated [2023-11-29 00:27:03,811 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,811 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,811 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,812 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,812 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,812 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_7 : int :: #memory_int#2 == old(#memory_int#2)[~#pstate~0!base := old(#memory_int#2)[~#pstate~0!base][4 * v_subst_7 := #memory_int#2[~#pstate~0!base][4 * v_subst_7]]] && v_subst_7 <= 0) could not be translated [2023-11-29 00:27:03,812 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,812 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,813 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,813 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,813 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,813 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,813 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,814 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,814 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,814 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,814 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,814 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists g_~i~2#1 : int :: (#memory_$Pointer$#1.base[~#pp~0!base][g_~i~2#1 * 4] == #in~pointer!base && #memory_$Pointer$#1.offset[~#pp~0!base][g_~i~2#1 * 4] == #in~pointer!offset) && !(#memory_$Pointer$#1.base[~#pp~0!base][g_~i~2#1 * 4] == 0)) could not be translated [2023-11-29 00:27:03,814 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,815 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,815 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_9 : int :: v_subst_9 <= 0 && #memory_int#2 == old(#memory_int#2)[~#pstate~0!base := old(#memory_int#2)[~#pstate~0!base][4 * v_subst_9 := #memory_int#2[~#pstate~0!base][4 * v_subst_9]]]) could not be translated [2023-11-29 00:27:03,815 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated [2023-11-29 00:27:03,815 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,815 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,815 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,816 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,816 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,816 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,816 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,817 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,817 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,817 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,817 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,817 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,817 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,818 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,818 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,818 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,818 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,818 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,818 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,819 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,819 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,819 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,819 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,819 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,819 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,820 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,820 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,820 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,820 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,820 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,820 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,820 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,821 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,825 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,825 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,825 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,825 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated [2023-11-29 00:27:03,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,831 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,831 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,831 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated [2023-11-29 00:27:03,831 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,831 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 00:27:03,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,833 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,833 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated [2023-11-29 00:27:03,833 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated [2023-11-29 00:27:03,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:27:03 BoogieIcfgContainer [2023-11-29 00:27:03,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:27:03,834 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:27:03,834 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:27:03,834 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:27:03,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:23:16" (3/4) ... [2023-11-29 00:27:03,837 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:27:03,840 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2023-11-29 00:27:03,840 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2023-11-29 00:27:03,841 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fake_malloc [2023-11-29 00:27:03,846 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 00:27:03,846 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 00:27:03,846 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:27:03,846 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:27:03,933 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:27:03,934 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:27:03,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:27:03,935 INFO L158 Benchmark]: Toolchain (without parser) took 228376.87ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 114.6MB in the beginning and 207.3MB in the end (delta: -92.8MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2023-11-29 00:27:03,935 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:27:03,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.46ms. Allocated memory is still 157.3MB. Free memory was 114.6MB in the beginning and 120.9MB in the end (delta: -6.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:27:03,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.73ms. Allocated memory is still 157.3MB. Free memory was 120.9MB in the beginning and 119.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:27:03,936 INFO L158 Benchmark]: Boogie Preprocessor took 50.20ms. Allocated memory is still 157.3MB. Free memory was 119.1MB in the beginning and 116.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:27:03,936 INFO L158 Benchmark]: RCFGBuilder took 381.76ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 100.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 00:27:03,937 INFO L158 Benchmark]: TraceAbstraction took 227532.96ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 99.4MB in the beginning and 211.5MB in the end (delta: -112.1MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. [2023-11-29 00:27:03,937 INFO L158 Benchmark]: Witness Printer took 99.91ms. Allocated memory is still 285.2MB. Free memory was 211.5MB in the beginning and 207.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:27:03,939 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.14ms. Allocated memory is still 107.0MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.46ms. Allocated memory is still 157.3MB. Free memory was 114.6MB in the beginning and 120.9MB in the end (delta: -6.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.73ms. Allocated memory is still 157.3MB. Free memory was 120.9MB in the beginning and 119.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.20ms. Allocated memory is still 157.3MB. Free memory was 119.1MB in the beginning and 116.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.76ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 100.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 227532.96ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 99.4MB in the beginning and 211.5MB in the end (delta: -112.1MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. * Witness Printer took 99.91ms. Allocated memory is still 285.2MB. Free memory was 211.5MB in the beginning and 207.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][~i~2 * 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_7 : int :: #memory_int#2 == old(#memory_int#2)[~#pstate~0!base := old(#memory_int#2)[~#pstate~0!base][4 * v_subst_7 := #memory_int#2[~#pstate~0!base][4 * v_subst_7]]] && v_subst_7 <= 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists g_~i~2#1 : int :: (#memory_$Pointer$#1.base[~#pp~0!base][g_~i~2#1 * 4] == #in~pointer!base && #memory_$Pointer$#1.offset[~#pp~0!base][g_~i~2#1 * 4] == #in~pointer!offset) && !(#memory_$Pointer$#1.base[~#pp~0!base][g_~i~2#1 * 4] == 0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_9 : int :: v_subst_9 <= 0 && #memory_int#2 == old(#memory_int#2)[~#pstate~0!base := old(#memory_int#2)[~#pstate~0!base][4 * v_subst_9 := #memory_int#2[~#pstate~0!base][4 * v_subst_9]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.base)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$#1.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int#2)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#pp~0!base][0] could not be translated * 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 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 227.4s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 198.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 70 mSolverCounterUnknown, 2801 SdHoareTripleChecker+Valid, 153.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2785 mSDsluCounter, 1361 SdHoareTripleChecker+Invalid, 152.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1084 mSDsCounter, 683 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12840 IncrementalHoareTripleChecker+Invalid, 13593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 683 mSolverCounterUnsat, 277 mSDtfsCounter, 12840 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1690 GetRequests, 941 SyntacticMatches, 21 SemanticMatches, 728 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11414 ImplicationChecksByTransitivity, 54.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=9, InterpolantAutomatonStates: 387, 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, 18 MinimizatonAttempts, 307 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 161 PreInvPairs, 219 NumberOfFragments, 2064 HoareAnnotationTreeSize, 161 FomulaSimplifications, 28949 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 5327 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1694 ConstructedInterpolants, 33 QuantifiedInterpolants, 12092 SizeOfPredicates, 91 NumberOfNonLiveVariables, 4410 ConjunctsInSsa, 386 ConjunctsInUnsatCore, 43 InterpolantComputations, 6 PerfectInterpolantSequences, 580/948 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((i == 0) && (counter == 1)) || ((1 <= i) && (counter == 1))) RESULT: Ultimate proved your program to be correct! [2023-11-29 00:27:03,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ea49f3-39f8-43ee-9922-b2768b5e9106/bin/uautomizer-verify-BQ2R08f2Ya/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 Writing output log to file Ultimate.log Result: TRUE