./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --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 c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:45:45,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:45:45,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:45:45,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:45:45,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:45:45,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:45:45,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:45:45,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:45:45,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:45:45,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:45:45,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:45:45,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:45:45,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:45:45,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:45:45,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:45:45,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:45:45,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:45:45,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:45:45,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:45:45,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:45:45,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:45:45,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:45:45,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:45:45,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:45:45,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:45:45,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:45:45,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:45:45,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:45:45,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:45:45,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:45:45,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:45:45,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:45:45,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:45:45,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:45:45,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:45:45,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:45:45,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:45:45,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:45:45,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:45:45,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:45:45,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:45:45,961 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:45:45,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:45:45,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:45:45,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:45:45,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:45:45,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:45:45,992 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:45:45,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:45:45,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:45:45,993 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:45:45,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:45:45,994 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:45:45,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:45:45,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:45:45,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:45:45,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:45:45,995 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:45:45,996 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:45:45,996 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:45:45,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:45:45,996 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:45:45,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:45:45,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:45:45,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:45:45,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:45:45,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:45:45,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:45:45,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:45:45,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:45:45,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:45:46,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:45:46,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/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_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 [2022-11-20 10:45:46,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:45:46,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:45:46,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:45:46,329 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:45:46,329 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:45:46,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2022-11-20 10:45:50,196 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:45:50,613 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:45:50,614 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2022-11-20 10:45:50,635 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/data/7f3285a7c/c05cb00c1e014ac1a6d68e943cd1672e/FLAG7355c8272 [2022-11-20 10:45:50,660 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/data/7f3285a7c/c05cb00c1e014ac1a6d68e943cd1672e [2022-11-20 10:45:50,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:45:50,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:45:50,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:45:50,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:45:50,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:45:50,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:45:50" (1/1) ... [2022-11-20 10:45:50,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce47525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:50, skipping insertion in model container [2022-11-20 10:45:50,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:45:50" (1/1) ... [2022-11-20 10:45:50,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:45:50,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:45:51,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:45:51,738 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:45:51,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:45:51,956 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:45:51,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51 WrapperNode [2022-11-20 10:45:51,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:45:51,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:45:51,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:45:51,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:45:51,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:51,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,027 INFO L138 Inliner]: procedures = 370, calls = 30, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 116 [2022-11-20 10:45:52,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:45:52,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:45:52,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:45:52,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:45:52,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,067 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:45:52,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:45:52,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:45:52,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:45:52,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (1/1) ... [2022-11-20 10:45:52,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:45:52,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:45:52,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:45:52,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:45:52,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:45:52,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:45:52,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:45:52,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:45:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:45:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 10:45:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:45:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:45:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:45:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-20 10:45:52,180 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-20 10:45:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:45:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:45:52,183 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:45:52,449 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:45:52,452 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:45:53,102 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:45:53,113 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:45:53,113 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:45:53,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:45:53 BoogieIcfgContainer [2022-11-20 10:45:53,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:45:53,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:45:53,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:45:53,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:45:53,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:45:50" (1/3) ... [2022-11-20 10:45:53,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a8ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:45:53, skipping insertion in model container [2022-11-20 10:45:53,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:51" (2/3) ... [2022-11-20 10:45:53,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a8ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:45:53, skipping insertion in model container [2022-11-20 10:45:53,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:45:53" (3/3) ... [2022-11-20 10:45:53,129 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.i [2022-11-20 10:45:53,156 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:45:53,157 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-20 10:45:53,157 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:45:53,278 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:45:53,328 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 10:45:53,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 187 transitions, 379 flow [2022-11-20 10:45:53,352 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 187 transitions, 379 flow [2022-11-20 10:45:53,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 187 transitions, 379 flow [2022-11-20 10:45:53,466 INFO L130 PetriNetUnfolder]: 4/186 cut-off events. [2022-11-20 10:45:53,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:45:53,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 186 events. 4/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 196 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-20 10:45:53,478 INFO L119 LiptonReduction]: Number of co-enabled transitions 3136 [2022-11-20 10:46:41,146 WARN L233 SmtUtils]: Spent 16.72s on a formula simplification. DAG size of input: 257 DAG size of output: 239 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:46:48,819 WARN L233 SmtUtils]: Spent 7.65s on a formula simplification that was a NOOP. DAG size: 227 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:47:04,802 WARN L233 SmtUtils]: Spent 15.98s on a formula simplification. DAG size of input: 260 DAG size of output: 242 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:47:11,834 WARN L233 SmtUtils]: Spent 7.03s on a formula simplification that was a NOOP. DAG size: 230 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:47:11,840 INFO L134 LiptonReduction]: Checked pairs total: 12454 [2022-11-20 10:47:11,840 INFO L136 LiptonReduction]: Total number of compositions: 249 [2022-11-20 10:47:11,848 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 61 transitions, 127 flow [2022-11-20 10:47:11,888 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 371 states, 248 states have (on average 2.75) internal successors, (682), 370 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:11,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:47:11,923 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=FINITE_AUTOMATA, 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;@7c00a6bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:47:11,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-20 10:47:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 371 states, 248 states have (on average 2.75) internal successors, (682), 370 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 10:47:11,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:11,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 10:47:11,937 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 22096, now seen corresponding path program 1 times [2022-11-20 10:47:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:11,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354365808] [2022-11-20 10:47:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:11,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:12,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354365808] [2022-11-20 10:47:12,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354365808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:12,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:12,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:47:12,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641862475] [2022-11-20 10:47:12,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:12,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:47:12,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:47:12,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:12,353 INFO L87 Difference]: Start difference. First operand has 371 states, 248 states have (on average 2.75) internal successors, (682), 370 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:12,693 INFO L93 Difference]: Finished difference Result 322 states and 603 transitions. [2022-11-20 10:47:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:47:12,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-20 10:47:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:12,718 INFO L225 Difference]: With dead ends: 322 [2022-11-20 10:47:12,725 INFO L226 Difference]: Without dead ends: 322 [2022-11-20 10:47:12,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:12,737 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:12,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:47:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-20 10:47:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-11-20 10:47:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 233 states have (on average 2.587982832618026) internal successors, (603), 321 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 603 transitions. [2022-11-20 10:47:12,852 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 603 transitions. Word has length 2 [2022-11-20 10:47:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:12,852 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 603 transitions. [2022-11-20 10:47:12,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 603 transitions. [2022-11-20 10:47:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 10:47:12,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:12,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 10:47:12,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:47:12,855 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 683419, now seen corresponding path program 1 times [2022-11-20 10:47:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:12,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684231456] [2022-11-20 10:47:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:12,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:12,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684231456] [2022-11-20 10:47:12,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684231456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:12,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204982038] [2022-11-20 10:47:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:12,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:12,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:12,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:13,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:47:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:47:13,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:13,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:13,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204982038] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:47:13,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:47:13,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-20 10:47:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137007184] [2022-11-20 10:47:13,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:13,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:47:13,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:13,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:47:13,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:47:13,186 INFO L87 Difference]: Start difference. First operand 322 states and 603 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:13,803 INFO L93 Difference]: Finished difference Result 325 states and 606 transitions. [2022-11-20 10:47:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:47:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 10:47:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:13,807 INFO L225 Difference]: With dead ends: 325 [2022-11-20 10:47:13,808 INFO L226 Difference]: Without dead ends: 325 [2022-11-20 10:47:13,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:47:13,809 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:13,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:47:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-20 10:47:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-11-20 10:47:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 236 states have (on average 2.5677966101694913) internal successors, (606), 324 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 606 transitions. [2022-11-20 10:47:13,828 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 606 transitions. Word has length 3 [2022-11-20 10:47:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:13,829 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 606 transitions. [2022-11-20 10:47:13,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 606 transitions. [2022-11-20 10:47:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:47:13,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:13,830 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-20 10:47:13,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:14,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-20 10:47:14,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:14,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:14,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1116647152, now seen corresponding path program 2 times [2022-11-20 10:47:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:14,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982249575] [2022-11-20 10:47:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:14,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:14,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:14,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982249575] [2022-11-20 10:47:14,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982249575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:14,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463299570] [2022-11-20 10:47:14,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:47:14,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:14,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:14,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:14,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:47:14,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:47:14,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:47:14,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:47:14,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:47:14,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:47:14,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463299570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:14,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:47:14,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-20 10:47:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5195056] [2022-11-20 10:47:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:14,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:47:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:14,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:47:14,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:47:14,506 INFO L87 Difference]: Start difference. First operand 325 states and 606 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:14,783 INFO L93 Difference]: Finished difference Result 292 states and 543 transitions. [2022-11-20 10:47:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:47:14,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 10:47:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:14,786 INFO L225 Difference]: With dead ends: 292 [2022-11-20 10:47:14,786 INFO L226 Difference]: Without dead ends: 292 [2022-11-20 10:47:14,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:47:14,787 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:14,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:47:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-20 10:47:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-20 10:47:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 216 states have (on average 2.513888888888889) internal successors, (543), 291 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 543 transitions. [2022-11-20 10:47:14,802 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 543 transitions. Word has length 6 [2022-11-20 10:47:14,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:14,802 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 543 transitions. [2022-11-20 10:47:14,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 543 transitions. [2022-11-20 10:47:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:47:14,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:14,803 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-11-20 10:47:14,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:15,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:15,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:15,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1512338813, now seen corresponding path program 1 times [2022-11-20 10:47:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:15,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41181199] [2022-11-20 10:47:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:15,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:15,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41181199] [2022-11-20 10:47:15,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41181199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:15,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29025730] [2022-11-20 10:47:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:15,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:15,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:15,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:15,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:47:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:15,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:47:15,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:15,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:15,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29025730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:47:15,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:47:15,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-20 10:47:15,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369369111] [2022-11-20 10:47:15,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:15,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:47:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:15,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:47:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:47:15,646 INFO L87 Difference]: Start difference. First operand 292 states and 543 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:16,036 INFO L93 Difference]: Finished difference Result 298 states and 549 transitions. [2022-11-20 10:47:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:47:16,037 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 10:47:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:16,039 INFO L225 Difference]: With dead ends: 298 [2022-11-20 10:47:16,039 INFO L226 Difference]: Without dead ends: 298 [2022-11-20 10:47:16,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:47:16,040 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:16,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:47:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-20 10:47:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-11-20 10:47:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 222 states have (on average 2.472972972972973) internal successors, (549), 297 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 549 transitions. [2022-11-20 10:47:16,053 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 549 transitions. Word has length 9 [2022-11-20 10:47:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:16,054 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 549 transitions. [2022-11-20 10:47:16,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 549 transitions. [2022-11-20 10:47:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:47:16,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:16,055 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-20 10:47:16,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 10:47:16,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:16,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1287549539, now seen corresponding path program 2 times [2022-11-20 10:47:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:16,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224117704] [2022-11-20 10:47:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 10:47:18,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:18,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224117704] [2022-11-20 10:47:18,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224117704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:18,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:18,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:47:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374841942] [2022-11-20 10:47:18,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:18,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:18,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:18,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:18,464 INFO L87 Difference]: Start difference. First operand 298 states and 549 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:18,719 INFO L93 Difference]: Finished difference Result 294 states and 540 transitions. [2022-11-20 10:47:18,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:47:18,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 10:47:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:18,722 INFO L225 Difference]: With dead ends: 294 [2022-11-20 10:47:18,722 INFO L226 Difference]: Without dead ends: 294 [2022-11-20 10:47:18,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:18,723 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:18,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 2 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:47:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-20 10:47:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-11-20 10:47:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 219 states have (on average 2.4657534246575343) internal successors, (540), 293 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 540 transitions. [2022-11-20 10:47:18,737 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 540 transitions. Word has length 15 [2022-11-20 10:47:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:18,738 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 540 transitions. [2022-11-20 10:47:18,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 540 transitions. [2022-11-20 10:47:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:47:18,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:18,739 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-20 10:47:18,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:47:18,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1287549437, now seen corresponding path program 1 times [2022-11-20 10:47:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:18,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178985658] [2022-11-20 10:47:18,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 10:47:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:18,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178985658] [2022-11-20 10:47:18,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178985658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:18,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:18,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:47:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712811258] [2022-11-20 10:47:18,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:18,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:47:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:18,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:47:18,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:18,854 INFO L87 Difference]: Start difference. First operand 294 states and 540 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:19,107 INFO L93 Difference]: Finished difference Result 479 states and 881 transitions. [2022-11-20 10:47:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:47:19,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 10:47:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:19,110 INFO L225 Difference]: With dead ends: 479 [2022-11-20 10:47:19,110 INFO L226 Difference]: Without dead ends: 479 [2022-11-20 10:47:19,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:19,112 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:19,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 6 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:47:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-20 10:47:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 292. [2022-11-20 10:47:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 217 states have (on average 2.4700460829493087) internal successors, (536), 291 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 536 transitions. [2022-11-20 10:47:19,127 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 536 transitions. Word has length 15 [2022-11-20 10:47:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:19,127 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 536 transitions. [2022-11-20 10:47:19,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 536 transitions. [2022-11-20 10:47:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:47:19,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:19,128 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:19,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:47:19,129 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1259327090, now seen corresponding path program 1 times [2022-11-20 10:47:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:19,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258915695] [2022-11-20 10:47:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 10:47:22,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:22,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258915695] [2022-11-20 10:47:22,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258915695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:22,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:22,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045494812] [2022-11-20 10:47:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:22,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:22,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:22,344 INFO L87 Difference]: Start difference. First operand 292 states and 536 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:22,774 INFO L93 Difference]: Finished difference Result 303 states and 570 transitions. [2022-11-20 10:47:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:47:22,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 10:47:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:22,777 INFO L225 Difference]: With dead ends: 303 [2022-11-20 10:47:22,777 INFO L226 Difference]: Without dead ends: 303 [2022-11-20 10:47:22,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:47:22,778 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:22,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:47:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-20 10:47:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2022-11-20 10:47:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 229 states have (on average 2.489082969432314) internal successors, (570), 302 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 570 transitions. [2022-11-20 10:47:22,789 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 570 transitions. Word has length 16 [2022-11-20 10:47:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:22,790 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 570 transitions. [2022-11-20 10:47:22,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 570 transitions. [2022-11-20 10:47:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:47:22,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:22,791 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:22,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:47:22,792 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1259327428, now seen corresponding path program 1 times [2022-11-20 10:47:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:22,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613431140] [2022-11-20 10:47:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 10:47:26,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:26,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613431140] [2022-11-20 10:47:26,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613431140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:26,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:26,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454227260] [2022-11-20 10:47:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:26,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:26,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:26,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:26,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:26,022 INFO L87 Difference]: Start difference. First operand 303 states and 570 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:26,501 INFO L93 Difference]: Finished difference Result 299 states and 561 transitions. [2022-11-20 10:47:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:26,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 10:47:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:26,504 INFO L225 Difference]: With dead ends: 299 [2022-11-20 10:47:26,504 INFO L226 Difference]: Without dead ends: 299 [2022-11-20 10:47:26,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:47:26,505 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:26,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:47:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-20 10:47:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-11-20 10:47:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 226 states have (on average 2.482300884955752) internal successors, (561), 298 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 561 transitions. [2022-11-20 10:47:26,516 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 561 transitions. Word has length 16 [2022-11-20 10:47:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:26,517 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 561 transitions. [2022-11-20 10:47:26,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:26,517 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 561 transitions. [2022-11-20 10:47:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:47:26,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:26,519 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:26,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:47:26,520 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:26,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1259394518, now seen corresponding path program 1 times [2022-11-20 10:47:26,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:26,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9556999] [2022-11-20 10:47:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:26,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 10:47:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:26,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9556999] [2022-11-20 10:47:26,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9556999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:26,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:26,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:47:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841842492] [2022-11-20 10:47:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:26,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:47:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:26,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:47:26,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:26,693 INFO L87 Difference]: Start difference. First operand 299 states and 561 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:26,961 INFO L93 Difference]: Finished difference Result 283 states and 533 transitions. [2022-11-20 10:47:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:47:26,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 10:47:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:26,964 INFO L225 Difference]: With dead ends: 283 [2022-11-20 10:47:26,964 INFO L226 Difference]: Without dead ends: 283 [2022-11-20 10:47:26,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:26,965 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:26,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:47:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-20 10:47:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-11-20 10:47:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 217 states have (on average 2.456221198156682) internal successors, (533), 282 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 533 transitions. [2022-11-20 10:47:26,975 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 533 transitions. Word has length 16 [2022-11-20 10:47:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:26,976 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 533 transitions. [2022-11-20 10:47:26,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 533 transitions. [2022-11-20 10:47:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:47:26,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:26,978 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:26,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:47:26,978 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:26,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1259394487, now seen corresponding path program 1 times [2022-11-20 10:47:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:26,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394000559] [2022-11-20 10:47:26,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 10:47:27,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:27,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394000559] [2022-11-20 10:47:27,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394000559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:27,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:27,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:47:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500568549] [2022-11-20 10:47:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:27,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:47:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:27,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:47:27,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:27,087 INFO L87 Difference]: Start difference. First operand 283 states and 533 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:27,362 INFO L93 Difference]: Finished difference Result 319 states and 585 transitions. [2022-11-20 10:47:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:47:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 10:47:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:27,365 INFO L225 Difference]: With dead ends: 319 [2022-11-20 10:47:27,365 INFO L226 Difference]: Without dead ends: 319 [2022-11-20 10:47:27,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:27,366 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:27,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:47:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-20 10:47:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 271. [2022-11-20 10:47:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 212 states have (on average 2.4622641509433962) internal successors, (522), 270 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 522 transitions. [2022-11-20 10:47:27,377 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 522 transitions. Word has length 16 [2022-11-20 10:47:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:27,378 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 522 transitions. [2022-11-20 10:47:27,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 522 transitions. [2022-11-20 10:47:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:47:27,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:27,380 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:27,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:47:27,381 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash 384443841, now seen corresponding path program 1 times [2022-11-20 10:47:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:27,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928108341] [2022-11-20 10:47:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 10:47:30,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:30,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928108341] [2022-11-20 10:47:30,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928108341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:30,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:30,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803880878] [2022-11-20 10:47:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:30,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:47:30,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:30,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:47:30,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:47:30,007 INFO L87 Difference]: Start difference. First operand 271 states and 522 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:30,427 INFO L93 Difference]: Finished difference Result 269 states and 518 transitions. [2022-11-20 10:47:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:47:30,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 10:47:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:30,429 INFO L225 Difference]: With dead ends: 269 [2022-11-20 10:47:30,429 INFO L226 Difference]: Without dead ends: 269 [2022-11-20 10:47:30,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:47:30,430 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:30,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 5 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:47:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-20 10:47:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-11-20 10:47:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 210 states have (on average 2.466666666666667) internal successors, (518), 268 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 518 transitions. [2022-11-20 10:47:30,438 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 518 transitions. Word has length 17 [2022-11-20 10:47:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:30,439 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 518 transitions. [2022-11-20 10:47:30,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 518 transitions. [2022-11-20 10:47:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:47:30,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:30,440 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:30,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:47:30,440 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:30,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash 384630150, now seen corresponding path program 1 times [2022-11-20 10:47:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:30,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494889502] [2022-11-20 10:47:30,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 10:47:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:30,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494889502] [2022-11-20 10:47:30,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494889502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:30,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:30,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84298066] [2022-11-20 10:47:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:30,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:30,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:30,840 INFO L87 Difference]: Start difference. First operand 269 states and 518 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:31,150 INFO L93 Difference]: Finished difference Result 343 states and 627 transitions. [2022-11-20 10:47:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:47:31,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 10:47:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:31,153 INFO L225 Difference]: With dead ends: 343 [2022-11-20 10:47:31,153 INFO L226 Difference]: Without dead ends: 343 [2022-11-20 10:47:31,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:47:31,154 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 100 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:31,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:47:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-20 10:47:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 255. [2022-11-20 10:47:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 204 states have (on average 2.406862745098039) internal successors, (491), 254 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 491 transitions. [2022-11-20 10:47:31,163 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 491 transitions. Word has length 17 [2022-11-20 10:47:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:31,163 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 491 transitions. [2022-11-20 10:47:31,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 491 transitions. [2022-11-20 10:47:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:47:31,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:31,165 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:31,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:47:31,165 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 10:47:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash 386525019, now seen corresponding path program 1 times [2022-11-20 10:47:31,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:31,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922114675] [2022-11-20 10:47:31,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:47:31,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:47:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:47:31,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:47:31,358 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:47:31,360 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 52 remaining) [2022-11-20 10:47:31,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 52 remaining) [2022-11-20 10:47:31,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 52 remaining) [2022-11-20 10:47:31,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 52 remaining) [2022-11-20 10:47:31,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 52 remaining) [2022-11-20 10:47:31,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 52 remaining) [2022-11-20 10:47:31,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 52 remaining) [2022-11-20 10:47:31,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 52 remaining) [2022-11-20 10:47:31,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 52 remaining) [2022-11-20 10:47:31,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 52 remaining) [2022-11-20 10:47:31,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 52 remaining) [2022-11-20 10:47:31,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 52 remaining) [2022-11-20 10:47:31,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 52 remaining) [2022-11-20 10:47:31,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 52 remaining) [2022-11-20 10:47:31,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 52 remaining) [2022-11-20 10:47:31,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 52 remaining) [2022-11-20 10:47:31,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 52 remaining) [2022-11-20 10:47:31,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 52 remaining) [2022-11-20 10:47:31,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 52 remaining) [2022-11-20 10:47:31,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 52 remaining) [2022-11-20 10:47:31,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 52 remaining) [2022-11-20 10:47:31,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 52 remaining) [2022-11-20 10:47:31,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 52 remaining) [2022-11-20 10:47:31,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 52 remaining) [2022-11-20 10:47:31,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 52 remaining) [2022-11-20 10:47:31,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 52 remaining) [2022-11-20 10:47:31,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 52 remaining) [2022-11-20 10:47:31,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (24 of 52 remaining) [2022-11-20 10:47:31,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 52 remaining) [2022-11-20 10:47:31,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 52 remaining) [2022-11-20 10:47:31,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 52 remaining) [2022-11-20 10:47:31,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 52 remaining) [2022-11-20 10:47:31,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 52 remaining) [2022-11-20 10:47:31,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 52 remaining) [2022-11-20 10:47:31,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 52 remaining) [2022-11-20 10:47:31,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 52 remaining) [2022-11-20 10:47:31,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 52 remaining) [2022-11-20 10:47:31,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 52 remaining) [2022-11-20 10:47:31,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 52 remaining) [2022-11-20 10:47:31,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 52 remaining) [2022-11-20 10:47:31,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 52 remaining) [2022-11-20 10:47:31,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 52 remaining) [2022-11-20 10:47:31,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 52 remaining) [2022-11-20 10:47:31,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 52 remaining) [2022-11-20 10:47:31,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 52 remaining) [2022-11-20 10:47:31,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 52 remaining) [2022-11-20 10:47:31,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 52 remaining) [2022-11-20 10:47:31,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 52 remaining) [2022-11-20 10:47:31,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 52 remaining) [2022-11-20 10:47:31,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 52 remaining) [2022-11-20 10:47:31,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 52 remaining) [2022-11-20 10:47:31,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 52 remaining) [2022-11-20 10:47:31,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:47:31,376 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:31,382 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:47:31,382 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:47:31,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:47:31 BasicIcfg [2022-11-20 10:47:31,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:47:31,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:47:31,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:47:31,456 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:47:31,457 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:45:53" (3/4) ... [2022-11-20 10:47:31,459 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:47:31,535 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:47:31,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:47:31,536 INFO L158 Benchmark]: Toolchain (without parser) took 100865.72ms. Allocated memory was 159.4MB in the beginning and 503.3MB in the end (delta: 343.9MB). Free memory was 124.7MB in the beginning and 185.6MB in the end (delta: -60.9MB). Peak memory consumption was 285.1MB. Max. memory is 16.1GB. [2022-11-20 10:47:31,536 INFO L158 Benchmark]: CDTParser took 1.36ms. Allocated memory is still 159.4MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:47:31,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1280.32ms. Allocated memory is still 159.4MB. Free memory was 124.7MB in the beginning and 85.7MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-20 10:47:31,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.42ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:47:31,538 INFO L158 Benchmark]: Boogie Preprocessor took 45.30ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:47:31,539 INFO L158 Benchmark]: RCFGBuilder took 1042.11ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 80.9MB in the beginning and 183.0MB in the end (delta: -102.0MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2022-11-20 10:47:31,540 INFO L158 Benchmark]: TraceAbstraction took 98335.92ms. Allocated memory was 216.0MB in the beginning and 503.3MB in the end (delta: 287.3MB). Free memory was 182.1MB in the beginning and 190.9MB in the end (delta: -8.7MB). Peak memory consumption was 279.6MB. Max. memory is 16.1GB. [2022-11-20 10:47:31,540 INFO L158 Benchmark]: Witness Printer took 79.20ms. Allocated memory is still 503.3MB. Free memory was 189.8MB in the beginning and 185.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:47:31,544 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36ms. Allocated memory is still 159.4MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1280.32ms. Allocated memory is still 159.4MB. Free memory was 124.7MB in the beginning and 85.7MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.42ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.30ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1042.11ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 80.9MB in the beginning and 183.0MB in the end (delta: -102.0MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * TraceAbstraction took 98335.92ms. Allocated memory was 216.0MB in the beginning and 503.3MB in the end (delta: 287.3MB). Free memory was 182.1MB in the beginning and 190.9MB in the end (delta: -8.7MB). Peak memory consumption was 279.6MB. Max. memory is 16.1GB. * Witness Printer took 79.20ms. Allocated memory is still 503.3MB. Free memory was 189.8MB in the beginning and 185.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 78.5s, 187 PlacesBefore, 64 PlacesAfterwards, 187 TransitionsBefore, 61 TransitionsAfterwards, 3136 CoEnabledTransitionPairs, 9 FixpointIterations, 155 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 249 TotalNumberOfCompositions, 12454 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5076, independent: 4561, independent conditional: 0, independent unconditional: 4561, dependent: 515, dependent conditional: 0, dependent unconditional: 515, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2198, independent: 2111, independent conditional: 0, independent unconditional: 2111, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2198, independent: 2042, independent conditional: 0, independent unconditional: 2042, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 156, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 543, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 427, dependent conditional: 0, dependent unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5076, independent: 2450, independent conditional: 0, independent unconditional: 2450, dependent: 428, dependent conditional: 0, dependent unconditional: 428, unknown: 2198, unknown conditional: 0, unknown unconditional: 2198] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 208, Positive conditional cache size: 0, Positive unconditional cache size: 208, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] 0 struct s *p; [L1259] 0 pthread_t t1; [L1260] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1260] RET, EXPR 0 new(1) [L1260] 0 slot[j] = new(1) [L1261] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1261] RET, EXPR 0 new(2) [L1261] EXPR 0 slot[j] [L1261] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node [L1241] 0 node->next = temp [L1261] RET 0 list_add(new(2), slot[j]) [L1262] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [i=10, j=1, mutex={1:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, slot={2:0}, t1={9:0}] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); VAL [\old(x)=2, \old(x)=3, \result={-2:0}, malloc(sizeof(struct s))={-3:0}, mutex={1:0}, p={-2:0}, p={-3:0}, slot={2:0}, x=2, x=3] [L1234] 1 p->datum = x VAL [\old(x)=2, \old(x)=3, \result={-2:0}, mutex={1:0}, p={-2:0}, p={-3:0}, slot={2:0}, x=3, x=2] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - 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: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 241 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 98.1s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 78.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 425 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 425 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1304 IncrementalHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 22 mSDtfsCounter, 1304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=0, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 323 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 183 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 450/493 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! [2022-11-20 10:47:31,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce00420b-d7a1-41e8-b89e-68a6c0f9446d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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)