./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/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_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:54:31,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:54:31,993 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:54:31,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:54:31,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:54:32,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:54:32,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:54:32,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:54:32,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:54:32,033 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:54:32,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:54:32,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:54:32,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:54:32,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:54:32,036 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:54:32,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:54:32,037 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:54:32,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:54:32,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:54:32,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:54:32,039 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:54:32,040 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:54:32,040 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:54:32,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:54:32,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:54:32,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:54:32,042 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:54:32,043 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:54:32,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:54:32,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:54:32,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:54:32,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:54:32,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:54:32,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:54:32,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:54:32,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:54:32,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:54:32,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:54:32,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:54:32,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:54:32,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:54:32,048 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_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/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_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2023-11-29 06:54:32,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:54:32,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:54:32,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:54:32,349 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:54:32,350 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:54:32,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2023-11-29 06:54:35,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:54:35,957 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:54:35,958 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2023-11-29 06:54:35,978 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/data/6054847b1/ec83eb5efefa4b0989d3e718a3033762/FLAGde2de12e6 [2023-11-29 06:54:35,996 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/data/6054847b1/ec83eb5efefa4b0989d3e718a3033762 [2023-11-29 06:54:35,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:54:36,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:54:36,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:54:36,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:54:36,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:54:36,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:54:35" (1/1) ... [2023-11-29 06:54:36,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37dfa08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36, skipping insertion in model container [2023-11-29 06:54:36,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:54:35" (1/1) ... [2023-11-29 06:54:36,073 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:54:36,581 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:54:36,599 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:54:36,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:54:36,716 WARN L675 CHandler]: The function strncpy is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:54:36,725 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:54:36,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36 WrapperNode [2023-11-29 06:54:36,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:54:36,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:54:36,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:54:36,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:54:36,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,798 INFO L138 Inliner]: procedures = 184, calls = 150, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 234 [2023-11-29 06:54:36,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:54:36,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:54:36,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:54:36,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:54:36,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,855 INFO L175 MemorySlicer]: Split 93 memory accesses to 3 slices as follows [2, 19, 72]. 77 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9, 0]. The 44 writes are split as follows [0, 6, 38]. [2023-11-29 06:54:36,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:54:36,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:54:36,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:54:36,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:54:36,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (1/1) ... [2023-11-29 06:54:36,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:54:36,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:54:36,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:54:36,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:54:36,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:54:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:54:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:54:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-29 06:54:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-29 06:54:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2023-11-29 06:54:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2023-11-29 06:54:36,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:54:36,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:54:36,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:54:36,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:54:36,985 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2023-11-29 06:54:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2023-11-29 06:54:36,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:54:36,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:54:36,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:54:36,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:54:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:54:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2023-11-29 06:54:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2023-11-29 06:54:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2023-11-29 06:54:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2023-11-29 06:54:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2023-11-29 06:54:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2023-11-29 06:54:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:54:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:54:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:54:36,989 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2023-11-29 06:54:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2023-11-29 06:54:36,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:54:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2023-11-29 06:54:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2023-11-29 06:54:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:54:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:54:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:54:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2023-11-29 06:54:36,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2023-11-29 06:54:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2023-11-29 06:54:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:54:36,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:54:37,163 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:54:37,165 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:54:37,870 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:54:37,939 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:54:37,939 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:54:37,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:54:37 BoogieIcfgContainer [2023-11-29 06:54:37,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:54:37,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:54:37,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:54:37,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:54:37,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:54:35" (1/3) ... [2023-11-29 06:54:37,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fecb7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:54:37, skipping insertion in model container [2023-11-29 06:54:37,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:54:36" (2/3) ... [2023-11-29 06:54:37,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fecb7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:54:37, skipping insertion in model container [2023-11-29 06:54:37,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:54:37" (3/3) ... [2023-11-29 06:54:37,948 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2023-11-29 06:54:37,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:54:37,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 162 error locations. [2023-11-29 06:54:38,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:54:38,027 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@28e9dd96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:54:38,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2023-11-29 06:54:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 161 states have (on average 2.186335403726708) internal successors, (352), 323 states have internal predecessors, (352), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-29 06:54:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 06:54:38,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:38,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:54:38,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:38,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash 623714232, now seen corresponding path program 1 times [2023-11-29 06:54:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106684825] [2023-11-29 06:54:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106684825] [2023-11-29 06:54:38,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106684825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:38,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:38,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:54:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544682165] [2023-11-29 06:54:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:38,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:54:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:38,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:54:38,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:54:38,459 INFO L87 Difference]: Start difference. First operand has 362 states, 161 states have (on average 2.186335403726708) internal successors, (352), 323 states have internal predecessors, (352), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:39,476 INFO L93 Difference]: Finished difference Result 436 states and 542 transitions. [2023-11-29 06:54:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:54:39,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2023-11-29 06:54:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:39,495 INFO L225 Difference]: With dead ends: 436 [2023-11-29 06:54:39,495 INFO L226 Difference]: Without dead ends: 435 [2023-11-29 06:54:39,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:54:39,500 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 538 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:39,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 306 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:54:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-11-29 06:54:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 356. [2023-11-29 06:54:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 174 states have (on average 2.0) internal successors, (348), 312 states have internal predecessors, (348), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2023-11-29 06:54:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 417 transitions. [2023-11-29 06:54:39,573 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 417 transitions. Word has length 5 [2023-11-29 06:54:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:39,574 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 417 transitions. [2023-11-29 06:54:39,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 417 transitions. [2023-11-29 06:54:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 06:54:39,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:39,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:54:39,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:54:39,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:39,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash 623714233, now seen corresponding path program 1 times [2023-11-29 06:54:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:39,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383323235] [2023-11-29 06:54:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:39,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383323235] [2023-11-29 06:54:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383323235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:39,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:39,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:54:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425332753] [2023-11-29 06:54:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:39,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:54:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:54:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:54:39,744 INFO L87 Difference]: Start difference. First operand 356 states and 417 transitions. Second operand has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:40,620 INFO L93 Difference]: Finished difference Result 502 states and 646 transitions. [2023-11-29 06:54:40,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:54:40,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2023-11-29 06:54:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:40,630 INFO L225 Difference]: With dead ends: 502 [2023-11-29 06:54:40,631 INFO L226 Difference]: Without dead ends: 502 [2023-11-29 06:54:40,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:54:40,633 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 358 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:40,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 793 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:54:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-11-29 06:54:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 422. [2023-11-29 06:54:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 228 states have (on average 1.8728070175438596) internal successors, (427), 363 states have internal predecessors, (427), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2023-11-29 06:54:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 524 transitions. [2023-11-29 06:54:40,684 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 524 transitions. Word has length 5 [2023-11-29 06:54:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:40,685 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 524 transitions. [2023-11-29 06:54:40,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 524 transitions. [2023-11-29 06:54:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 06:54:40,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:40,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:40,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:54:40,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:40,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1042625853, now seen corresponding path program 1 times [2023-11-29 06:54:40,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:40,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413354993] [2023-11-29 06:54:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:40,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:40,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:40,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413354993] [2023-11-29 06:54:40,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413354993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:40,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:40,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:54:40,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040876405] [2023-11-29 06:54:40,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:40,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:54:40,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:40,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:54:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:54:40,878 INFO L87 Difference]: Start difference. First operand 422 states and 524 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:41,635 INFO L93 Difference]: Finished difference Result 476 states and 624 transitions. [2023-11-29 06:54:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:54:41,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-11-29 06:54:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:41,642 INFO L225 Difference]: With dead ends: 476 [2023-11-29 06:54:41,642 INFO L226 Difference]: Without dead ends: 476 [2023-11-29 06:54:41,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:54:41,644 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 152 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:41,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1039 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:54:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-11-29 06:54:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 421. [2023-11-29 06:54:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 228 states have (on average 1.868421052631579) internal successors, (426), 362 states have internal predecessors, (426), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2023-11-29 06:54:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 523 transitions. [2023-11-29 06:54:41,697 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 523 transitions. Word has length 8 [2023-11-29 06:54:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:41,698 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 523 transitions. [2023-11-29 06:54:41,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 523 transitions. [2023-11-29 06:54:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 06:54:41,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:41,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:41,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:54:41,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:41,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1042625854, now seen corresponding path program 1 times [2023-11-29 06:54:41,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:41,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526747032] [2023-11-29 06:54:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:41,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:41,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:41,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526747032] [2023-11-29 06:54:41,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526747032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:41,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:41,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:54:41,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666405333] [2023-11-29 06:54:41,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:41,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:54:41,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:54:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:54:41,942 INFO L87 Difference]: Start difference. First operand 421 states and 523 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:42,743 INFO L93 Difference]: Finished difference Result 475 states and 623 transitions. [2023-11-29 06:54:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:54:42,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-11-29 06:54:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:42,749 INFO L225 Difference]: With dead ends: 475 [2023-11-29 06:54:42,749 INFO L226 Difference]: Without dead ends: 475 [2023-11-29 06:54:42,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:54:42,751 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 149 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:42,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1017 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:54:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-11-29 06:54:42,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 420. [2023-11-29 06:54:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 228 states have (on average 1.8640350877192982) internal successors, (425), 361 states have internal predecessors, (425), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2023-11-29 06:54:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 522 transitions. [2023-11-29 06:54:42,778 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 522 transitions. Word has length 8 [2023-11-29 06:54:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:42,778 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 522 transitions. [2023-11-29 06:54:42,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 522 transitions. [2023-11-29 06:54:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 06:54:42,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:42,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:42,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:54:42,780 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:42,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1717601966, now seen corresponding path program 1 times [2023-11-29 06:54:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:42,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956859677] [2023-11-29 06:54:42,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:42,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956859677] [2023-11-29 06:54:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956859677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:54:42,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80296449] [2023-11-29 06:54:42,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:42,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:54:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:42,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:54:42,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:54:42,851 INFO L87 Difference]: Start difference. First operand 420 states and 522 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:43,318 INFO L93 Difference]: Finished difference Result 474 states and 622 transitions. [2023-11-29 06:54:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:54:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-29 06:54:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:43,323 INFO L225 Difference]: With dead ends: 474 [2023-11-29 06:54:43,323 INFO L226 Difference]: Without dead ends: 474 [2023-11-29 06:54:43,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:54:43,325 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 144 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:43,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 655 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:54:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-11-29 06:54:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 419. [2023-11-29 06:54:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 228 states have (on average 1.8596491228070176) internal successors, (424), 360 states have internal predecessors, (424), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2023-11-29 06:54:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 521 transitions. [2023-11-29 06:54:43,345 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 521 transitions. Word has length 12 [2023-11-29 06:54:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:43,346 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 521 transitions. [2023-11-29 06:54:43,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 521 transitions. [2023-11-29 06:54:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 06:54:43,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:43,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:43,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:54:43,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:43,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:43,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1717601965, now seen corresponding path program 1 times [2023-11-29 06:54:43,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:43,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028483317] [2023-11-29 06:54:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:43,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:43,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:43,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:43,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028483317] [2023-11-29 06:54:43,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028483317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:43,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:43,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:54:43,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081083597] [2023-11-29 06:54:43,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:43,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:54:43,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:43,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:54:43,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:54:43,447 INFO L87 Difference]: Start difference. First operand 419 states and 521 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:43,920 INFO L93 Difference]: Finished difference Result 473 states and 621 transitions. [2023-11-29 06:54:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:54:43,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-29 06:54:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:43,925 INFO L225 Difference]: With dead ends: 473 [2023-11-29 06:54:43,925 INFO L226 Difference]: Without dead ends: 473 [2023-11-29 06:54:43,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:54:43,927 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 143 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:43,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 641 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:54:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-11-29 06:54:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 418. [2023-11-29 06:54:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 228 states have (on average 1.855263157894737) internal successors, (423), 359 states have internal predecessors, (423), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2023-11-29 06:54:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 520 transitions. [2023-11-29 06:54:43,951 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 520 transitions. Word has length 12 [2023-11-29 06:54:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:43,951 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 520 transitions. [2023-11-29 06:54:43,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 520 transitions. [2023-11-29 06:54:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 06:54:43,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:43,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:43,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:54:43,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:43,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1901166374, now seen corresponding path program 1 times [2023-11-29 06:54:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:43,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258951205] [2023-11-29 06:54:43,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:43,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258951205] [2023-11-29 06:54:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258951205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:44,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:44,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:54:44,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881507143] [2023-11-29 06:54:44,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:44,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:54:44,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:44,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:54:44,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:54:44,155 INFO L87 Difference]: Start difference. First operand 418 states and 520 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:45,081 INFO L93 Difference]: Finished difference Result 506 states and 679 transitions. [2023-11-29 06:54:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:54:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-29 06:54:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:45,087 INFO L225 Difference]: With dead ends: 506 [2023-11-29 06:54:45,087 INFO L226 Difference]: Without dead ends: 506 [2023-11-29 06:54:45,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:54:45,089 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 220 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:45,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1387 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:54:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2023-11-29 06:54:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 438. [2023-11-29 06:54:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 244 states have (on average 1.8319672131147542) internal successors, (447), 376 states have internal predecessors, (447), 43 states have call successors, (43), 20 states have call predecessors, (43), 22 states have return successors, (59), 41 states have call predecessors, (59), 43 states have call successors, (59) [2023-11-29 06:54:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 549 transitions. [2023-11-29 06:54:45,110 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 549 transitions. Word has length 20 [2023-11-29 06:54:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:45,110 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 549 transitions. [2023-11-29 06:54:45,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 549 transitions. [2023-11-29 06:54:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 06:54:45,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:45,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:45,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:54:45,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:45,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:45,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1901166373, now seen corresponding path program 1 times [2023-11-29 06:54:45,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:45,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70089184] [2023-11-29 06:54:45,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:45,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70089184] [2023-11-29 06:54:45,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70089184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:45,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:45,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:54:45,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775579580] [2023-11-29 06:54:45,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:45,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:54:45,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:45,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:54:45,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:54:45,433 INFO L87 Difference]: Start difference. First operand 438 states and 549 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:46,458 INFO L93 Difference]: Finished difference Result 505 states and 678 transitions. [2023-11-29 06:54:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:54:46,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-29 06:54:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:46,464 INFO L225 Difference]: With dead ends: 505 [2023-11-29 06:54:46,464 INFO L226 Difference]: Without dead ends: 505 [2023-11-29 06:54:46,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:54:46,465 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 211 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:46,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1336 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:54:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2023-11-29 06:54:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 438. [2023-11-29 06:54:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 244 states have (on average 1.8278688524590163) internal successors, (446), 376 states have internal predecessors, (446), 43 states have call successors, (43), 20 states have call predecessors, (43), 22 states have return successors, (59), 41 states have call predecessors, (59), 43 states have call successors, (59) [2023-11-29 06:54:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 548 transitions. [2023-11-29 06:54:46,482 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 548 transitions. Word has length 20 [2023-11-29 06:54:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:46,483 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 548 transitions. [2023-11-29 06:54:46,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 548 transitions. [2023-11-29 06:54:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 06:54:46,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:46,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:46,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:54:46,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:46,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1190591824, now seen corresponding path program 1 times [2023-11-29 06:54:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964744088] [2023-11-29 06:54:46,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:46,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:46,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964744088] [2023-11-29 06:54:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964744088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:46,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:46,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:54:46,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058587824] [2023-11-29 06:54:46,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:46,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:54:46,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:54:46,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:54:46,642 INFO L87 Difference]: Start difference. First operand 438 states and 548 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:47,507 INFO L93 Difference]: Finished difference Result 592 states and 803 transitions. [2023-11-29 06:54:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:54:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-29 06:54:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:47,513 INFO L225 Difference]: With dead ends: 592 [2023-11-29 06:54:47,513 INFO L226 Difference]: Without dead ends: 592 [2023-11-29 06:54:47,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:54:47,515 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 340 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:47,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1321 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:54:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2023-11-29 06:54:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 473. [2023-11-29 06:54:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 270 states have (on average 1.8111111111111111) internal successors, (489), 405 states have internal predecessors, (489), 49 states have call successors, (49), 24 states have call predecessors, (49), 25 states have return successors, (71), 43 states have call predecessors, (71), 49 states have call successors, (71) [2023-11-29 06:54:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 609 transitions. [2023-11-29 06:54:47,543 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 609 transitions. Word has length 21 [2023-11-29 06:54:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:47,544 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 609 transitions. [2023-11-29 06:54:47,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 609 transitions. [2023-11-29 06:54:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 06:54:47,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:47,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:47,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:54:47,545 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:47,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:47,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1190591825, now seen corresponding path program 1 times [2023-11-29 06:54:47,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:47,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120049735] [2023-11-29 06:54:47,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:47,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:47,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120049735] [2023-11-29 06:54:47,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120049735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:47,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:47,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:54:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141420865] [2023-11-29 06:54:47,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:47,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:54:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:47,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:54:47,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:54:47,806 INFO L87 Difference]: Start difference. First operand 473 states and 609 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:48,360 INFO L93 Difference]: Finished difference Result 493 states and 616 transitions. [2023-11-29 06:54:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:54:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-29 06:54:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:48,365 INFO L225 Difference]: With dead ends: 493 [2023-11-29 06:54:48,365 INFO L226 Difference]: Without dead ends: 493 [2023-11-29 06:54:48,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:54:48,366 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 231 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:48,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1272 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:54:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-11-29 06:54:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 470. [2023-11-29 06:54:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 263 states have (on average 1.7452471482889733) internal successors, (459), 395 states have internal predecessors, (459), 47 states have call successors, (47), 22 states have call predecessors, (47), 31 states have return successors, (99), 52 states have call predecessors, (99), 47 states have call successors, (99) [2023-11-29 06:54:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 605 transitions. [2023-11-29 06:54:48,391 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 605 transitions. Word has length 21 [2023-11-29 06:54:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:48,391 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 605 transitions. [2023-11-29 06:54:48,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:54:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 605 transitions. [2023-11-29 06:54:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 06:54:48,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:48,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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 06:54:48,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:54:48,394 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:48,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1908770742, now seen corresponding path program 1 times [2023-11-29 06:54:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361156362] [2023-11-29 06:54:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:48,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:54:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:48,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:48,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361156362] [2023-11-29 06:54:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361156362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:48,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:48,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:54:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114218669] [2023-11-29 06:54:48,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:48,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:54:48,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:48,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:54:48,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:54:48,551 INFO L87 Difference]: Start difference. First operand 470 states and 605 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:54:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:49,105 INFO L93 Difference]: Finished difference Result 490 states and 623 transitions. [2023-11-29 06:54:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:54:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-29 06:54:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:49,110 INFO L225 Difference]: With dead ends: 490 [2023-11-29 06:54:49,110 INFO L226 Difference]: Without dead ends: 486 [2023-11-29 06:54:49,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:54:49,111 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 164 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:49,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1186 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:54:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-11-29 06:54:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 479. [2023-11-29 06:54:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 270 states have (on average 1.7333333333333334) internal successors, (468), 403 states have internal predecessors, (468), 47 states have call successors, (47), 23 states have call predecessors, (47), 33 states have return successors, (99), 52 states have call predecessors, (99), 47 states have call successors, (99) [2023-11-29 06:54:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 614 transitions. [2023-11-29 06:54:49,136 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 614 transitions. Word has length 30 [2023-11-29 06:54:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:49,137 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 614 transitions. [2023-11-29 06:54:49,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:54:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 614 transitions. [2023-11-29 06:54:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 06:54:49,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:49,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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 06:54:49,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:54:49,139 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:49,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2039089993, now seen corresponding path program 1 times [2023-11-29 06:54:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634456980] [2023-11-29 06:54:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:49,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 06:54:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:49,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 06:54:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634456980] [2023-11-29 06:54:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634456980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:49,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 06:54:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915358776] [2023-11-29 06:54:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:49,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:54:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:54:49,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:54:49,574 INFO L87 Difference]: Start difference. First operand 479 states and 614 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:54:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:50,878 INFO L93 Difference]: Finished difference Result 505 states and 669 transitions. [2023-11-29 06:54:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:54:50,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-11-29 06:54:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:50,883 INFO L225 Difference]: With dead ends: 505 [2023-11-29 06:54:50,883 INFO L226 Difference]: Without dead ends: 499 [2023-11-29 06:54:50,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:54:50,884 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 313 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:50,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1765 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 06:54:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2023-11-29 06:54:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 477. [2023-11-29 06:54:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 269 states have (on average 1.7323420074349443) internal successors, (466), 401 states have internal predecessors, (466), 47 states have call successors, (47), 23 states have call predecessors, (47), 32 states have return successors, (98), 52 states have call predecessors, (98), 47 states have call successors, (98) [2023-11-29 06:54:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 611 transitions. [2023-11-29 06:54:50,920 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 611 transitions. Word has length 29 [2023-11-29 06:54:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:50,920 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 611 transitions. [2023-11-29 06:54:50,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:54:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 611 transitions. [2023-11-29 06:54:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 06:54:50,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:50,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:50,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:54:50,922 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:50,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash -645868780, now seen corresponding path program 1 times [2023-11-29 06:54:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:50,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674314667] [2023-11-29 06:54:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:51,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:51,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:54:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:51,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:51,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674314667] [2023-11-29 06:54:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674314667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:51,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:54:51,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227042486] [2023-11-29 06:54:51,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:51,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:54:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:51,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:54:51,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:54:51,268 INFO L87 Difference]: Start difference. First operand 477 states and 611 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:54:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:52,209 INFO L93 Difference]: Finished difference Result 458 states and 571 transitions. [2023-11-29 06:54:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:54:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2023-11-29 06:54:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:52,213 INFO L225 Difference]: With dead ends: 458 [2023-11-29 06:54:52,213 INFO L226 Difference]: Without dead ends: 456 [2023-11-29 06:54:52,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:54:52,215 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 198 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:52,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1546 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:54:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-11-29 06:54:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2023-11-29 06:54:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 222 states have (on average 1.8153153153153154) internal successors, (403), 356 states have internal predecessors, (403), 40 states have call successors, (40), 19 states have call predecessors, (40), 21 states have return successors, (58), 36 states have call predecessors, (58), 40 states have call successors, (58) [2023-11-29 06:54:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 501 transitions. [2023-11-29 06:54:52,233 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 501 transitions. Word has length 32 [2023-11-29 06:54:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:52,233 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 501 transitions. [2023-11-29 06:54:52,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:54:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 501 transitions. [2023-11-29 06:54:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 06:54:52,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:52,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:52,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:54:52,235 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:52,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1467299206, now seen corresponding path program 1 times [2023-11-29 06:54:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902332221] [2023-11-29 06:54:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:52,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:52,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:54:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:52,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:52,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902332221] [2023-11-29 06:54:52,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902332221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:52,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:52,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:54:52,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807690734] [2023-11-29 06:54:52,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:52,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:54:52,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:52,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:54:52,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:54:52,709 INFO L87 Difference]: Start difference. First operand 412 states and 501 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:54:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:53,647 INFO L93 Difference]: Finished difference Result 463 states and 599 transitions. [2023-11-29 06:54:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:54:53,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-11-29 06:54:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:53,651 INFO L225 Difference]: With dead ends: 463 [2023-11-29 06:54:53,651 INFO L226 Difference]: Without dead ends: 463 [2023-11-29 06:54:53,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:54:53,653 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 1322 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:53,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 307 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:54:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-11-29 06:54:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 393. [2023-11-29 06:54:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 222 states have (on average 1.7027027027027026) internal successors, (378), 337 states have internal predecessors, (378), 40 states have call successors, (40), 19 states have call predecessors, (40), 21 states have return successors, (58), 36 states have call predecessors, (58), 40 states have call successors, (58) [2023-11-29 06:54:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 476 transitions. [2023-11-29 06:54:53,673 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 476 transitions. Word has length 33 [2023-11-29 06:54:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:53,673 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 476 transitions. [2023-11-29 06:54:53,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:54:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 476 transitions. [2023-11-29 06:54:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 06:54:53,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:53,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:53,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:54:53,675 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:53,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:53,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1758364824, now seen corresponding path program 1 times [2023-11-29 06:54:53,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:53,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052355940] [2023-11-29 06:54:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:53,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:54,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:54,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:54:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:54,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:54,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052355940] [2023-11-29 06:54:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052355940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:54,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 06:54:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084343784] [2023-11-29 06:54:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:54,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:54:54,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:54,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:54:54,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:54:54,567 INFO L87 Difference]: Start difference. First operand 393 states and 476 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:54:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:55,963 INFO L93 Difference]: Finished difference Result 609 states and 821 transitions. [2023-11-29 06:54:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:54:55,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2023-11-29 06:54:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:55,968 INFO L225 Difference]: With dead ends: 609 [2023-11-29 06:54:55,968 INFO L226 Difference]: Without dead ends: 609 [2023-11-29 06:54:55,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-29 06:54:55,969 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 628 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:55,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1361 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 06:54:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2023-11-29 06:54:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 483. [2023-11-29 06:54:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 290 states have (on average 1.6724137931034482) internal successors, (485), 408 states have internal predecessors, (485), 54 states have call successors, (54), 27 states have call predecessors, (54), 29 states have return successors, (83), 47 states have call predecessors, (83), 54 states have call successors, (83) [2023-11-29 06:54:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 622 transitions. [2023-11-29 06:54:56,000 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 622 transitions. Word has length 34 [2023-11-29 06:54:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:56,000 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 622 transitions. [2023-11-29 06:54:56,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:54:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 622 transitions. [2023-11-29 06:54:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 06:54:56,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:56,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:56,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:54:56,002 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:56,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1758364823, now seen corresponding path program 1 times [2023-11-29 06:54:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927856417] [2023-11-29 06:54:56,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:57,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:57,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:54:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927856417] [2023-11-29 06:54:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927856417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:57,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:57,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 06:54:57,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236043945] [2023-11-29 06:54:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:57,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 06:54:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 06:54:57,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:54:57,429 INFO L87 Difference]: Start difference. First operand 483 states and 622 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:54:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:59,121 INFO L93 Difference]: Finished difference Result 629 states and 827 transitions. [2023-11-29 06:54:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:54:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2023-11-29 06:54:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:59,127 INFO L225 Difference]: With dead ends: 629 [2023-11-29 06:54:59,127 INFO L226 Difference]: Without dead ends: 629 [2023-11-29 06:54:59,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:54:59,129 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 401 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:59,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1582 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 06:54:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2023-11-29 06:54:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 511. [2023-11-29 06:54:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 311 states have (on average 1.6270096463022508) internal successors, (506), 423 states have internal predecessors, (506), 54 states have call successors, (54), 27 states have call predecessors, (54), 36 states have return successors, (108), 60 states have call predecessors, (108), 54 states have call successors, (108) [2023-11-29 06:54:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 668 transitions. [2023-11-29 06:54:59,158 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 668 transitions. Word has length 34 [2023-11-29 06:54:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:59,158 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 668 transitions. [2023-11-29 06:54:59,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:54:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 668 transitions. [2023-11-29 06:54:59,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 06:54:59,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:59,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:59,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 06:54:59,160 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:59,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1866445911, now seen corresponding path program 1 times [2023-11-29 06:54:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671410037] [2023-11-29 06:54:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:59,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:59,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:54:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:59,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671410037] [2023-11-29 06:54:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671410037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:59,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:59,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:54:59,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724038932] [2023-11-29 06:54:59,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:59,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:54:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:59,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:54:59,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:54:59,280 INFO L87 Difference]: Start difference. First operand 511 states and 668 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:54:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:59,814 INFO L93 Difference]: Finished difference Result 564 states and 760 transitions. [2023-11-29 06:54:59,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:54:59,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-29 06:54:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:59,818 INFO L225 Difference]: With dead ends: 564 [2023-11-29 06:54:59,818 INFO L226 Difference]: Without dead ends: 564 [2023-11-29 06:54:59,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:54:59,819 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 138 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:59,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 739 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:54:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2023-11-29 06:54:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 509. [2023-11-29 06:54:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 311 states have (on average 1.6141479099678457) internal successors, (502), 421 states have internal predecessors, (502), 54 states have call successors, (54), 27 states have call predecessors, (54), 36 states have return successors, (108), 60 states have call predecessors, (108), 54 states have call successors, (108) [2023-11-29 06:54:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 664 transitions. [2023-11-29 06:54:59,836 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 664 transitions. Word has length 36 [2023-11-29 06:54:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:59,837 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 664 transitions. [2023-11-29 06:54:59,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:54:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 664 transitions. [2023-11-29 06:54:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 06:54:59,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:59,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:59,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:54:59,838 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:54:59,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1866445910, now seen corresponding path program 1 times [2023-11-29 06:54:59,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:59,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277638373] [2023-11-29 06:54:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:59,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:59,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:54:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:59,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277638373] [2023-11-29 06:54:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277638373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:54:59,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:54:59,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:54:59,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007376529] [2023-11-29 06:54:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:54:59,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:54:59,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:54:59,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:54:59,971 INFO L87 Difference]: Start difference. First operand 509 states and 664 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:00,417 INFO L93 Difference]: Finished difference Result 562 states and 756 transitions. [2023-11-29 06:55:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:55:00,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-29 06:55:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:00,422 INFO L225 Difference]: With dead ends: 562 [2023-11-29 06:55:00,422 INFO L226 Difference]: Without dead ends: 562 [2023-11-29 06:55:00,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:55:00,422 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 263 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:00,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 629 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:55:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2023-11-29 06:55:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 507. [2023-11-29 06:55:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 311 states have (on average 1.6012861736334405) internal successors, (498), 419 states have internal predecessors, (498), 54 states have call successors, (54), 27 states have call predecessors, (54), 36 states have return successors, (108), 60 states have call predecessors, (108), 54 states have call successors, (108) [2023-11-29 06:55:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 660 transitions. [2023-11-29 06:55:00,447 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 660 transitions. Word has length 36 [2023-11-29 06:55:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:00,447 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 660 transitions. [2023-11-29 06:55:00,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 660 transitions. [2023-11-29 06:55:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 06:55:00,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:00,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:00,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 06:55:00,449 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:55:00,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1326446247, now seen corresponding path program 1 times [2023-11-29 06:55:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905577015] [2023-11-29 06:55:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:55:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905577015] [2023-11-29 06:55:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905577015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:55:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672839585] [2023-11-29 06:55:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:00,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:55:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:55:00,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:55:00,690 INFO L87 Difference]: Start difference. First operand 507 states and 660 transitions. Second operand has 9 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:01,689 INFO L93 Difference]: Finished difference Result 627 states and 877 transitions. [2023-11-29 06:55:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:55:01,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-11-29 06:55:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:01,694 INFO L225 Difference]: With dead ends: 627 [2023-11-29 06:55:01,694 INFO L226 Difference]: Without dead ends: 627 [2023-11-29 06:55:01,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:55:01,695 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 353 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:01,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1370 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:55:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-11-29 06:55:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 547. [2023-11-29 06:55:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 343 states have (on average 1.5918367346938775) internal successors, (546), 453 states have internal predecessors, (546), 56 states have call successors, (56), 31 states have call predecessors, (56), 42 states have return successors, (121), 62 states have call predecessors, (121), 56 states have call successors, (121) [2023-11-29 06:55:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 723 transitions. [2023-11-29 06:55:01,715 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 723 transitions. Word has length 44 [2023-11-29 06:55:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:01,715 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 723 transitions. [2023-11-29 06:55:01,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 723 transitions. [2023-11-29 06:55:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 06:55:01,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:01,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:01,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 06:55:01,717 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:55:01,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1326446246, now seen corresponding path program 1 times [2023-11-29 06:55:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:01,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552269797] [2023-11-29 06:55:01,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:01,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:55:01,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:01,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552269797] [2023-11-29 06:55:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552269797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:01,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:01,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:55:01,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532863947] [2023-11-29 06:55:01,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:01,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:55:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:01,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:55:01,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:55:01,958 INFO L87 Difference]: Start difference. First operand 547 states and 723 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:02,770 INFO L93 Difference]: Finished difference Result 674 states and 915 transitions. [2023-11-29 06:55:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:55:02,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-11-29 06:55:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:02,776 INFO L225 Difference]: With dead ends: 674 [2023-11-29 06:55:02,776 INFO L226 Difference]: Without dead ends: 674 [2023-11-29 06:55:02,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:55:02,777 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 441 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:02,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1928 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:55:02,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2023-11-29 06:55:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 620. [2023-11-29 06:55:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 399 states have (on average 1.506265664160401) internal successors, (601), 500 states have internal predecessors, (601), 58 states have call successors, (58), 33 states have call predecessors, (58), 57 states have return successors, (191), 86 states have call predecessors, (191), 58 states have call successors, (191) [2023-11-29 06:55:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 850 transitions. [2023-11-29 06:55:02,811 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 850 transitions. Word has length 44 [2023-11-29 06:55:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:02,812 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 850 transitions. [2023-11-29 06:55:02,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 850 transitions. [2023-11-29 06:55:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 06:55:02,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:02,813 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:02,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 06:55:02,813 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:55:02,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1827046577, now seen corresponding path program 1 times [2023-11-29 06:55:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:02,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873058226] [2023-11-29 06:55:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:55:03,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:03,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873058226] [2023-11-29 06:55:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873058226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:03,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:55:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895713973] [2023-11-29 06:55:03,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:03,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:55:03,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:03,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:55:03,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:55:03,063 INFO L87 Difference]: Start difference. First operand 620 states and 850 transitions. Second operand has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:04,008 INFO L93 Difference]: Finished difference Result 737 states and 1039 transitions. [2023-11-29 06:55:04,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:55:04,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-29 06:55:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:04,015 INFO L225 Difference]: With dead ends: 737 [2023-11-29 06:55:04,015 INFO L226 Difference]: Without dead ends: 737 [2023-11-29 06:55:04,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:55:04,016 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 328 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:04,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1386 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:55:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2023-11-29 06:55:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 638. [2023-11-29 06:55:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 413 states have (on average 1.5060532687651331) internal successors, (622), 514 states have internal predecessors, (622), 60 states have call successors, (60), 35 states have call predecessors, (60), 59 states have return successors, (196), 88 states have call predecessors, (196), 60 states have call successors, (196) [2023-11-29 06:55:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 878 transitions. [2023-11-29 06:55:04,049 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 878 transitions. Word has length 45 [2023-11-29 06:55:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:04,050 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 878 transitions. [2023-11-29 06:55:04,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 878 transitions. [2023-11-29 06:55:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 06:55:04,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:04,050 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:04,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 06:55:04,051 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:55:04,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1827046578, now seen corresponding path program 1 times [2023-11-29 06:55:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:04,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664293770] [2023-11-29 06:55:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:04,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:55:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664293770] [2023-11-29 06:55:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664293770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:04,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:04,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:55:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965444806] [2023-11-29 06:55:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:04,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:55:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:04,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:55:04,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:55:04,488 INFO L87 Difference]: Start difference. First operand 638 states and 878 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:05,229 INFO L93 Difference]: Finished difference Result 678 states and 945 transitions. [2023-11-29 06:55:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:55:05,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-29 06:55:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:05,236 INFO L225 Difference]: With dead ends: 678 [2023-11-29 06:55:05,236 INFO L226 Difference]: Without dead ends: 678 [2023-11-29 06:55:05,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:55:05,237 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 349 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:05,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1388 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:55:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2023-11-29 06:55:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 638. [2023-11-29 06:55:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 413 states have (on average 1.4987893462469735) internal successors, (619), 514 states have internal predecessors, (619), 60 states have call successors, (60), 35 states have call predecessors, (60), 59 states have return successors, (196), 88 states have call predecessors, (196), 60 states have call successors, (196) [2023-11-29 06:55:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 875 transitions. [2023-11-29 06:55:05,257 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 875 transitions. Word has length 45 [2023-11-29 06:55:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:05,257 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 875 transitions. [2023-11-29 06:55:05,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:55:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 875 transitions. [2023-11-29 06:55:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 06:55:05,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:05,258 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, 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 06:55:05,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 06:55:05,258 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:55:05,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash 858378320, now seen corresponding path program 1 times [2023-11-29 06:55:05,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:05,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002524717] [2023-11-29 06:55:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:05,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:05,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:05,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:55:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:55:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:05,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002524717] [2023-11-29 06:55:05,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002524717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:05,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:05,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 06:55:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749792285] [2023-11-29 06:55:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:05,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:55:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:05,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:55:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:55:05,554 INFO L87 Difference]: Start difference. First operand 638 states and 875 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:55:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:06,331 INFO L93 Difference]: Finished difference Result 831 states and 1190 transitions. [2023-11-29 06:55:06,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:55:06,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-11-29 06:55:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:06,337 INFO L225 Difference]: With dead ends: 831 [2023-11-29 06:55:06,337 INFO L226 Difference]: Without dead ends: 831 [2023-11-29 06:55:06,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:55:06,338 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 237 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:06,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 2348 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:55:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2023-11-29 06:55:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 745. [2023-11-29 06:55:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 502 states have (on average 1.4741035856573705) internal successors, (740), 604 states have internal predecessors, (740), 68 states have call successors, (68), 47 states have call predecessors, (68), 69 states have return successors, (223), 93 states have call predecessors, (223), 68 states have call successors, (223) [2023-11-29 06:55:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1031 transitions. [2023-11-29 06:55:06,374 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1031 transitions. Word has length 51 [2023-11-29 06:55:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:06,374 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 1031 transitions. [2023-11-29 06:55:06,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:55:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1031 transitions. [2023-11-29 06:55:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 06:55:06,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:06,375 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, 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 06:55:06,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 06:55:06,376 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:55:06,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash 777288624, now seen corresponding path program 1 times [2023-11-29 06:55:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:06,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885689594] [2023-11-29 06:55:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:06,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:55:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:06,524 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 06:55:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:06,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885689594] [2023-11-29 06:55:06,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885689594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:06,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:06,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:55:06,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192110242] [2023-11-29 06:55:06,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:06,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:55:06,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:06,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:55:06,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:55:06,527 INFO L87 Difference]: Start difference. First operand 745 states and 1031 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:55:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:07,016 INFO L93 Difference]: Finished difference Result 766 states and 1073 transitions. [2023-11-29 06:55:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:55:07,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-11-29 06:55:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:07,022 INFO L225 Difference]: With dead ends: 766 [2023-11-29 06:55:07,022 INFO L226 Difference]: Without dead ends: 766 [2023-11-29 06:55:07,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:55:07,023 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 162 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:07,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 880 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:55:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-11-29 06:55:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 743. [2023-11-29 06:55:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 502 states have (on average 1.4701195219123506) internal successors, (738), 602 states have internal predecessors, (738), 68 states have call successors, (68), 47 states have call predecessors, (68), 69 states have return successors, (223), 93 states have call predecessors, (223), 68 states have call successors, (223) [2023-11-29 06:55:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1029 transitions. [2023-11-29 06:55:07,060 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1029 transitions. Word has length 51 [2023-11-29 06:55:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:07,060 INFO L495 AbstractCegarLoop]: Abstraction has 743 states and 1029 transitions. [2023-11-29 06:55:07,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:55:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1029 transitions. [2023-11-29 06:55:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 06:55:07,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:07,062 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, 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 06:55:07,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 06:55:07,062 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:55:07,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash 777288625, now seen corresponding path program 1 times [2023-11-29 06:55:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:07,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824321810] [2023-11-29 06:55:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:08,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:55:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:55:08,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:08,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824321810] [2023-11-29 06:55:08,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824321810] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:55:08,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58080971] [2023-11-29 06:55:08,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:08,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:55:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:55:08,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:55:08,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:55:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:08,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 06:55:08,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:55:08,573 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 10 treesize of output 8 [2023-11-29 06:55:08,588 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 7 treesize of output 6 [2023-11-29 06:55:08,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 06:55:08,616 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 16 [2023-11-29 06:55:08,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2023-11-29 06:55:08,640 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 16 [2023-11-29 06:55:08,690 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:55:08,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 63 [2023-11-29 06:55:08,700 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 38 treesize of output 21 [2023-11-29 06:55:08,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2023-11-29 06:55:08,730 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 16 [2023-11-29 06:55:08,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2023-11-29 06:55:08,749 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 16 [2023-11-29 06:55:08,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2023-11-29 06:55:08,769 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 16 [2023-11-29 06:55:08,867 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 23 treesize of output 11 [2023-11-29 06:55:08,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2023-11-29 06:55:08,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2023-11-29 06:55:08,943 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 16 [2023-11-29 06:55:08,974 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 32 treesize of output 14 [2023-11-29 06:55:08,999 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 12 [2023-11-29 06:55:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:55:09,013 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:55:09,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58080971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:55:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 16 [2023-11-29 06:55:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270350598] [2023-11-29 06:55:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:09,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:55:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:55:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-11-29 06:55:09,016 INFO L87 Difference]: Start difference. First operand 743 states and 1029 transitions. Second operand has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:55:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:10,131 INFO L93 Difference]: Finished difference Result 758 states and 1054 transitions. [2023-11-29 06:55:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:55:10,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2023-11-29 06:55:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:10,136 INFO L225 Difference]: With dead ends: 758 [2023-11-29 06:55:10,136 INFO L226 Difference]: Without dead ends: 758 [2023-11-29 06:55:10,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2023-11-29 06:55:10,137 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 225 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:10,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1925 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:55:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2023-11-29 06:55:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 724. [2023-11-29 06:55:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 485 states have (on average 1.4742268041237114) internal successors, (715), 585 states have internal predecessors, (715), 67 states have call successors, (67), 46 states have call predecessors, (67), 68 states have return successors, (218), 92 states have call predecessors, (218), 67 states have call successors, (218) [2023-11-29 06:55:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1000 transitions. [2023-11-29 06:55:10,165 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1000 transitions. Word has length 51 [2023-11-29 06:55:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:10,165 INFO L495 AbstractCegarLoop]: Abstraction has 724 states and 1000 transitions. [2023-11-29 06:55:10,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:55:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1000 transitions. [2023-11-29 06:55:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 06:55:10,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:10,166 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, 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 06:55:10,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:55:10,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:55:10,367 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:55:10,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:10,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1293044402, now seen corresponding path program 1 times [2023-11-29 06:55:10,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707531511] [2023-11-29 06:55:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:10,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:10,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:10,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 06:55:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:10,520 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 06:55:10,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:10,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707531511] [2023-11-29 06:55:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707531511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:10,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:10,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:55:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315002900] [2023-11-29 06:55:10,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:10,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:55:10,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:10,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:55:10,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:55:10,522 INFO L87 Difference]: Start difference. First operand 724 states and 1000 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:55:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:11,010 INFO L93 Difference]: Finished difference Result 745 states and 1042 transitions. [2023-11-29 06:55:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:55:11,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2023-11-29 06:55:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:11,014 INFO L225 Difference]: With dead ends: 745 [2023-11-29 06:55:11,014 INFO L226 Difference]: Without dead ends: 745 [2023-11-29 06:55:11,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:55:11,015 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 291 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:11,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 761 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:55:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-11-29 06:55:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 722. [2023-11-29 06:55:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 485 states have (on average 1.4701030927835053) internal successors, (713), 583 states have internal predecessors, (713), 67 states have call successors, (67), 46 states have call predecessors, (67), 68 states have return successors, (218), 92 states have call predecessors, (218), 67 states have call successors, (218) [2023-11-29 06:55:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 998 transitions. [2023-11-29 06:55:11,047 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 998 transitions. Word has length 52 [2023-11-29 06:55:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:11,047 INFO L495 AbstractCegarLoop]: Abstraction has 722 states and 998 transitions. [2023-11-29 06:55:11,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:55:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 998 transitions. [2023-11-29 06:55:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 06:55:11,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:11,048 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, 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 06:55:11,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 06:55:11,049 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-29 06:55:11,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1293044401, now seen corresponding path program 1 times [2023-11-29 06:55:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704275337] [2023-11-29 06:55:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:11,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:55:11,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:55:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:55:11,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:55:11,194 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:55:11,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 162 remaining) [2023-11-29 06:55:11,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 162 remaining) [2023-11-29 06:55:11,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 162 remaining) [2023-11-29 06:55:11,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 162 remaining) [2023-11-29 06:55:11,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 162 remaining) [2023-11-29 06:55:11,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 162 remaining) [2023-11-29 06:55:11,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 162 remaining) [2023-11-29 06:55:11,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 162 remaining) [2023-11-29 06:55:11,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 162 remaining) [2023-11-29 06:55:11,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 162 remaining) [2023-11-29 06:55:11,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 162 remaining) [2023-11-29 06:55:11,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 162 remaining) [2023-11-29 06:55:11,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 162 remaining) [2023-11-29 06:55:11,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 162 remaining) [2023-11-29 06:55:11,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 162 remaining) [2023-11-29 06:55:11,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 162 remaining) [2023-11-29 06:55:11,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 162 remaining) [2023-11-29 06:55:11,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 162 remaining) [2023-11-29 06:55:11,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 162 remaining) [2023-11-29 06:55:11,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 162 remaining) [2023-11-29 06:55:11,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 162 remaining) [2023-11-29 06:55:11,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 162 remaining) [2023-11-29 06:55:11,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 162 remaining) [2023-11-29 06:55:11,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 162 remaining) [2023-11-29 06:55:11,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 162 remaining) [2023-11-29 06:55:11,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 162 remaining) [2023-11-29 06:55:11,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 162 remaining) [2023-11-29 06:55:11,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 162 remaining) [2023-11-29 06:55:11,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 162 remaining) [2023-11-29 06:55:11,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 162 remaining) [2023-11-29 06:55:11,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 162 remaining) [2023-11-29 06:55:11,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 162 remaining) [2023-11-29 06:55:11,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 162 remaining) [2023-11-29 06:55:11,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 162 remaining) [2023-11-29 06:55:11,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 162 remaining) [2023-11-29 06:55:11,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 162 remaining) [2023-11-29 06:55:11,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 162 remaining) [2023-11-29 06:55:11,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 162 remaining) [2023-11-29 06:55:11,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 162 remaining) [2023-11-29 06:55:11,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 162 remaining) [2023-11-29 06:55:11,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 162 remaining) [2023-11-29 06:55:11,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 162 remaining) [2023-11-29 06:55:11,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 162 remaining) [2023-11-29 06:55:11,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 162 remaining) [2023-11-29 06:55:11,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 162 remaining) [2023-11-29 06:55:11,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 162 remaining) [2023-11-29 06:55:11,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 162 remaining) [2023-11-29 06:55:11,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 162 remaining) [2023-11-29 06:55:11,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 162 remaining) [2023-11-29 06:55:11,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 162 remaining) [2023-11-29 06:55:11,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 162 remaining) [2023-11-29 06:55:11,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 162 remaining) [2023-11-29 06:55:11,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 162 remaining) [2023-11-29 06:55:11,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 162 remaining) [2023-11-29 06:55:11,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 162 remaining) [2023-11-29 06:55:11,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 162 remaining) [2023-11-29 06:55:11,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 162 remaining) [2023-11-29 06:55:11,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 162 remaining) [2023-11-29 06:55:11,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 162 remaining) [2023-11-29 06:55:11,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 162 remaining) [2023-11-29 06:55:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 162 remaining) [2023-11-29 06:55:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 162 remaining) [2023-11-29 06:55:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 162 remaining) [2023-11-29 06:55:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 162 remaining) [2023-11-29 06:55:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 162 remaining) [2023-11-29 06:55:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 162 remaining) [2023-11-29 06:55:11,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 162 remaining) [2023-11-29 06:55:11,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 162 remaining) [2023-11-29 06:55:11,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 162 remaining) [2023-11-29 06:55:11,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 162 remaining) [2023-11-29 06:55:11,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 162 remaining) [2023-11-29 06:55:11,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 162 remaining) [2023-11-29 06:55:11,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 162 remaining) [2023-11-29 06:55:11,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 162 remaining) [2023-11-29 06:55:11,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 162 remaining) [2023-11-29 06:55:11,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 162 remaining) [2023-11-29 06:55:11,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 162 remaining) [2023-11-29 06:55:11,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 162 remaining) [2023-11-29 06:55:11,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 162 remaining) [2023-11-29 06:55:11,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 162 remaining) [2023-11-29 06:55:11,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 162 remaining) [2023-11-29 06:55:11,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 162 remaining) [2023-11-29 06:55:11,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 162 remaining) [2023-11-29 06:55:11,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 162 remaining) [2023-11-29 06:55:11,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 162 remaining) [2023-11-29 06:55:11,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 162 remaining) [2023-11-29 06:55:11,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 162 remaining) [2023-11-29 06:55:11,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 162 remaining) [2023-11-29 06:55:11,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 162 remaining) [2023-11-29 06:55:11,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 162 remaining) [2023-11-29 06:55:11,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 162 remaining) [2023-11-29 06:55:11,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 162 remaining) [2023-11-29 06:55:11,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 162 remaining) [2023-11-29 06:55:11,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 162 remaining) [2023-11-29 06:55:11,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 162 remaining) [2023-11-29 06:55:11,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 162 remaining) [2023-11-29 06:55:11,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 162 remaining) [2023-11-29 06:55:11,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 162 remaining) [2023-11-29 06:55:11,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 162 remaining) [2023-11-29 06:55:11,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 162 remaining) [2023-11-29 06:55:11,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 162 remaining) [2023-11-29 06:55:11,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 162 remaining) [2023-11-29 06:55:11,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 162 remaining) [2023-11-29 06:55:11,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 162 remaining) [2023-11-29 06:55:11,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 162 remaining) [2023-11-29 06:55:11,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 162 remaining) [2023-11-29 06:55:11,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 162 remaining) [2023-11-29 06:55:11,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 162 remaining) [2023-11-29 06:55:11,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 162 remaining) [2023-11-29 06:55:11,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 162 remaining) [2023-11-29 06:55:11,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 162 remaining) [2023-11-29 06:55:11,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 162 remaining) [2023-11-29 06:55:11,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 162 remaining) [2023-11-29 06:55:11,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 162 remaining) [2023-11-29 06:55:11,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 162 remaining) [2023-11-29 06:55:11,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 162 remaining) [2023-11-29 06:55:11,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 162 remaining) [2023-11-29 06:55:11,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 162 remaining) [2023-11-29 06:55:11,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 162 remaining) [2023-11-29 06:55:11,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 162 remaining) [2023-11-29 06:55:11,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 162 remaining) [2023-11-29 06:55:11,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 162 remaining) [2023-11-29 06:55:11,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 162 remaining) [2023-11-29 06:55:11,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 162 remaining) [2023-11-29 06:55:11,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 162 remaining) [2023-11-29 06:55:11,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 162 remaining) [2023-11-29 06:55:11,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 162 remaining) [2023-11-29 06:55:11,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 162 remaining) [2023-11-29 06:55:11,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (33 of 162 remaining) [2023-11-29 06:55:11,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (32 of 162 remaining) [2023-11-29 06:55:11,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 162 remaining) [2023-11-29 06:55:11,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 162 remaining) [2023-11-29 06:55:11,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 162 remaining) [2023-11-29 06:55:11,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 162 remaining) [2023-11-29 06:55:11,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 162 remaining) [2023-11-29 06:55:11,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 162 remaining) [2023-11-29 06:55:11,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 162 remaining) [2023-11-29 06:55:11,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 162 remaining) [2023-11-29 06:55:11,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 162 remaining) [2023-11-29 06:55:11,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 162 remaining) [2023-11-29 06:55:11,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 162 remaining) [2023-11-29 06:55:11,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 162 remaining) [2023-11-29 06:55:11,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 162 remaining) [2023-11-29 06:55:11,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 162 remaining) [2023-11-29 06:55:11,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 162 remaining) [2023-11-29 06:55:11,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 162 remaining) [2023-11-29 06:55:11,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 162 remaining) [2023-11-29 06:55:11,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 162 remaining) [2023-11-29 06:55:11,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 162 remaining) [2023-11-29 06:55:11,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 162 remaining) [2023-11-29 06:55:11,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 162 remaining) [2023-11-29 06:55:11,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 162 remaining) [2023-11-29 06:55:11,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 162 remaining) [2023-11-29 06:55:11,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 162 remaining) [2023-11-29 06:55:11,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 162 remaining) [2023-11-29 06:55:11,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 162 remaining) [2023-11-29 06:55:11,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 162 remaining) [2023-11-29 06:55:11,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 162 remaining) [2023-11-29 06:55:11,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 162 remaining) [2023-11-29 06:55:11,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 162 remaining) [2023-11-29 06:55:11,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 162 remaining) [2023-11-29 06:55:11,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 162 remaining) [2023-11-29 06:55:11,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 06:55:11,228 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 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 06:55:11,234 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:55:11,262 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc81 [2023-11-29 06:55:11,266 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,268 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,269 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,269 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,269 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,270 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,270 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,270 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,270 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,270 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,270 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,271 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,271 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,271 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,271 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,271 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,273 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch76 could not be translated [2023-11-29 06:55:11,274 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-29 06:55:11,275 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated [2023-11-29 06:55:11,275 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-29 06:55:11,275 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-29 06:55:11,276 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-29 06:55:11,277 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch76 could not be translated [2023-11-29 06:55:11,277 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated [2023-11-29 06:55:11,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated [2023-11-29 06:55:11,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated [2023-11-29 06:55:11,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc62 [2023-11-29 06:55:11,279 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc62 [2023-11-29 06:55:11,279 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated [2023-11-29 06:55:11,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:55:11 BoogieIcfgContainer [2023-11-29 06:55:11,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:55:11,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:55:11,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:55:11,293 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:55:11,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:54:37" (3/4) ... [2023-11-29 06:55:11,294 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 06:55:11,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc81 [2023-11-29 06:55:11,305 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,305 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,305 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-29 06:55:11,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 06:55:11,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-29 06:55:11,310 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch76 could not be translated [2023-11-29 06:55:11,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-29 06:55:11,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated [2023-11-29 06:55:11,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-29 06:55:11,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-29 06:55:11,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-29 06:55:11,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch76 could not be translated [2023-11-29 06:55:11,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated [2023-11-29 06:55:11,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated [2023-11-29 06:55:11,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated [2023-11-29 06:55:11,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc62 [2023-11-29 06:55:11,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc62 [2023-11-29 06:55:11,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated [2023-11-29 06:55:11,364 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:55:11,365 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:55:11,366 INFO L158 Benchmark]: Toolchain (without parser) took 35364.99ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 91.0MB in the beginning and 281.5MB in the end (delta: -190.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:55:11,366 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 159.4MB. Free memory was 133.5MB in the beginning and 133.3MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:55:11,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 723.47ms. Allocated memory is still 159.4MB. Free memory was 90.9MB in the beginning and 109.5MB in the end (delta: -18.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 06:55:11,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.32ms. Allocated memory is still 159.4MB. Free memory was 109.5MB in the beginning and 106.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:55:11,367 INFO L158 Benchmark]: Boogie Preprocessor took 100.70ms. Allocated memory is still 159.4MB. Free memory was 106.4MB in the beginning and 101.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:55:11,368 INFO L158 Benchmark]: RCFGBuilder took 1039.03ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 89.9MB in the end (delta: 11.4MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2023-11-29 06:55:11,368 INFO L158 Benchmark]: TraceAbstraction took 33349.77ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 89.6MB in the beginning and 286.8MB in the end (delta: -197.2MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. [2023-11-29 06:55:11,369 INFO L158 Benchmark]: Witness Printer took 72.76ms. Allocated memory is still 346.0MB. Free memory was 286.8MB in the beginning and 281.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:55:11,371 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.25ms. Allocated memory is still 159.4MB. Free memory was 133.5MB in the beginning and 133.3MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 723.47ms. Allocated memory is still 159.4MB. Free memory was 90.9MB in the beginning and 109.5MB in the end (delta: -18.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.32ms. Allocated memory is still 159.4MB. Free memory was 109.5MB in the beginning and 106.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.70ms. Allocated memory is still 159.4MB. Free memory was 106.4MB in the beginning and 101.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1039.03ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 89.9MB in the end (delta: 11.4MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33349.77ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 89.6MB in the beginning and 286.8MB in the end (delta: -197.2MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. * Witness Printer took 72.76ms. Allocated memory is still 346.0MB. Free memory was 286.8MB in the beginning and 281.5MB in the end (delta: 5.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: unknown boogie variable #t~malloc81 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc62 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc62 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc81 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc62 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc62 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch57 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 [L976] RET user_initialize() [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; VAL [user={-1:0}] [L978] e.primitive = _EVENT_START VAL [user={-1:0}] [L979] CALL event_precess(&e) VAL [e={10:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [e={10:0}, user={-1:0}] [L838] EXPR e->primitive [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [e={10:0}, e={10:0}, primitive=0, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}] [L815] COND TRUE user->status != status [L816] user->status = status [L817] return 10; VAL [\old(status)=2, \result=10, status=2, user={-1:0}] [L840] RET status_update(AS_START) VAL [e={10:0}, e={10:0}, primitive=0, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [e={9:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [e={9:0}, user={-1:0}] [L881] EXPR e->primitive [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: VAL [e={9:0}, e={9:0}, primitive=3, rc=-1, user={-1:0}] [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: VAL [e={9:0}, e={9:0}, primitive=3, rc=-1, user={-1:0}] [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [e={9:0}, e={9:0}, message={-1:16}, primitive=3, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) VAL [e={9:0}, e={9:0}, message={-2:0}, primitive=3, rc=-1, user={-1:0}] [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 362 locations, 162 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8306 SdHoareTripleChecker+Valid, 19.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8299 mSDsluCounter, 30868 SdHoareTripleChecker+Invalid, 16.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23472 mSDsCounter, 2420 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20229 IncrementalHoareTripleChecker+Invalid, 22649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2420 mSolverCounterUnsat, 7396 mSDtfsCounter, 20229 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=745occurred in iteration=23, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 1592 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 882 NumberOfCodeBlocks, 882 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 803 ConstructedInterpolants, 0 QuantifiedInterpolants, 4448 SizeOfPredicates, 13 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 51/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 06:55:11,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86a7f43f-8552-4c04-b73f-fdecf22ff5d0/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)