./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f 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_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8 --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 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb --- 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-e04fb08 [2022-11-16 11:34:34,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:34:34,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:34:34,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:34:34,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:34:34,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:34:34,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:34:34,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:34:34,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:34:34,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:34:34,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:34:34,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:34:34,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:34:34,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:34:34,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:34:34,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:34:34,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:34:34,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:34:34,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:34:34,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:34:34,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:34:34,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:34:34,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:34:34,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:34:34,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:34:34,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:34:34,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:34:34,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:34:34,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:34:34,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:34:34,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:34:34,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:34:34,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:34:34,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:34:34,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:34:34,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:34:34,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:34:34,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:34:34,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:34:34,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:34:34,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:34:34,868 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:34:34,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:34:34,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:34:34,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:34:34,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:34:34,905 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:34:34,905 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:34:34,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:34:34,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:34:34,906 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:34:34,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:34:34,907 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:34:34,908 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:34:34,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:34:34,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:34:34,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:34:34,909 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:34:34,909 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:34:34,909 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:34:34,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:34:34,909 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:34:34,910 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:34:34,910 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:34:34,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:34:34,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:34:34,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:34:34,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:34:34,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:34:34,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:34:34,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:34:34,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:34:34,912 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_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/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_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8 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 -> 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb [2022-11-16 11:34:35,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:34:35,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:34:35,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:34:35,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:34:35,231 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:34:35,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2022-11-16 11:34:35,324 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/data/0fb4983dc/5bdbe74652d0444a91393be6605b522c/FLAG7b9b73449 [2022-11-16 11:34:35,904 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:34:35,905 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2022-11-16 11:34:35,925 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/data/0fb4983dc/5bdbe74652d0444a91393be6605b522c/FLAG7b9b73449 [2022-11-16 11:34:36,167 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/data/0fb4983dc/5bdbe74652d0444a91393be6605b522c [2022-11-16 11:34:36,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:34:36,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:34:36,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:34:36,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:34:36,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:34:36,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:34:36" (1/1) ... [2022-11-16 11:34:36,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10dc8959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:36, skipping insertion in model container [2022-11-16 11:34:36,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:34:36" (1/1) ... [2022-11-16 11:34:36,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:34:36,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:34:37,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:34:37,106 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:34:37,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:34:37,267 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:34:37,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37 WrapperNode [2022-11-16 11:34:37,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:34:37,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:34:37,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:34:37,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:34:37,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,336 INFO L138 Inliner]: procedures = 371, calls = 34, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 119 [2022-11-16 11:34:37,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:34:37,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:34:37,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:34:37,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:34:37,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,392 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:34:37,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:34:37,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:34:37,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:34:37,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (1/1) ... [2022-11-16 11:34:37,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:34:37,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:37,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:34:37,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:34:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:34:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:34:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:34:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:34:37,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 11:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-16 11:34:37,495 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-16 11:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:34:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:34:37,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:34:37,497 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:34:37,680 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:34:37,683 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:34:38,204 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:34:38,212 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:34:38,215 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:34:38,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:34:38 BoogieIcfgContainer [2022-11-16 11:34:38,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:34:38,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:34:38,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:34:38,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:34:38,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:34:36" (1/3) ... [2022-11-16 11:34:38,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acbb86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:34:38, skipping insertion in model container [2022-11-16 11:34:38,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:37" (2/3) ... [2022-11-16 11:34:38,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acbb86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:34:38, skipping insertion in model container [2022-11-16 11:34:38,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:34:38" (3/3) ... [2022-11-16 11:34:38,227 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2022-11-16 11:34:38,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:34:38,248 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-16 11:34:38,248 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:34:38,329 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:34:38,365 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:34:38,381 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 190 transitions, 385 flow [2022-11-16 11:34:38,384 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 190 transitions, 385 flow [2022-11-16 11:34:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 190 transitions, 385 flow [2022-11-16 11:34:38,452 INFO L130 PetriNetUnfolder]: 4/189 cut-off events. [2022-11-16 11:34:38,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:34:38,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 189 events. 4/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2022-11-16 11:34:38,460 INFO L119 LiptonReduction]: Number of co-enabled transitions 3136 [2022-11-16 11:35:15,687 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 198 DAG size of output: 192 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:35:30,980 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 201 DAG size of output: 195 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:36:07,535 WARN L233 SmtUtils]: Spent 21.64s on a formula simplification. DAG size of input: 262 DAG size of output: 253 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:36:16,011 WARN L233 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 233 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:36:35,736 WARN L233 SmtUtils]: Spent 19.72s on a formula simplification. DAG size of input: 268 DAG size of output: 256 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:36:43,100 WARN L233 SmtUtils]: Spent 7.36s on a formula simplification that was a NOOP. DAG size: 233 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:36:43,171 INFO L134 LiptonReduction]: Checked pairs total: 11648 [2022-11-16 11:36:43,172 INFO L136 LiptonReduction]: Total number of compositions: 262 [2022-11-16 11:36:43,180 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 61 transitions, 127 flow [2022-11-16 11:36:43,217 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-16 11:36:43,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:36:43,239 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;@208a186a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:36:43,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-16 11:36:43,247 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-16 11:36:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:36:43,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:43,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:36:43,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:43,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash 22902, now seen corresponding path program 1 times [2022-11-16 11:36:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:43,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394057879] [2022-11-16 11:36:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:43,428 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-16 11:36:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:43,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394057879] [2022-11-16 11:36:43,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394057879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:43,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:43,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:36:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534727032] [2022-11-16 11:36:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:43,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:36:43,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:43,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:36:43,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:36:43,480 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 2 states, 1 states have (on average 2.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-16 11:36:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:43,736 INFO L93 Difference]: Finished difference Result 321 states and 602 transitions. [2022-11-16 11:36:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:36:43,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.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-16 11:36:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:43,750 INFO L225 Difference]: With dead ends: 321 [2022-11-16 11:36:43,751 INFO L226 Difference]: Without dead ends: 321 [2022-11-16 11:36:43,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:36:43,755 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:43,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:36:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-16 11:36:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-11-16 11:36:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 232 states have (on average 2.5948275862068964) internal successors, (602), 320 states have internal predecessors, (602), 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-16 11:36:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 602 transitions. [2022-11-16 11:36:43,811 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 602 transitions. Word has length 2 [2022-11-16 11:36:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:43,812 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 602 transitions. [2022-11-16 11:36:43,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.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-16 11:36:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 602 transitions. [2022-11-16 11:36:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:36:43,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:43,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:36:43,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:36:43,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash 22887, now seen corresponding path program 1 times [2022-11-16 11:36:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:43,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104594262] [2022-11-16 11:36:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:43,977 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-16 11:36:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:43,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104594262] [2022-11-16 11:36:43,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104594262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:43,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:43,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:36:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760336376] [2022-11-16 11:36:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:43,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:43,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:36:43,982 INFO L87 Difference]: Start difference. First operand 321 states and 602 transitions. 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-16 11:36:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:44,300 INFO L93 Difference]: Finished difference Result 322 states and 603 transitions. [2022-11-16 11:36:44,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:44,301 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-16 11:36:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:44,303 INFO L225 Difference]: With dead ends: 322 [2022-11-16 11:36:44,304 INFO L226 Difference]: Without dead ends: 322 [2022-11-16 11:36:44,304 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-16 11:36:44,305 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:44,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:36:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-16 11:36:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-11-16 11:36:44,335 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-16 11:36:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 603 transitions. [2022-11-16 11:36:44,337 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 603 transitions. Word has length 2 [2022-11-16 11:36:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:44,337 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 603 transitions. [2022-11-16 11:36:44,338 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-16 11:36:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 603 transitions. [2022-11-16 11:36:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:36:44,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:44,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:36:44,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:36:44,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:44,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash 708359, now seen corresponding path program 1 times [2022-11-16 11:36:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:44,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185992023] [2022-11-16 11:36:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:44,479 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-16 11:36:44,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:44,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185992023] [2022-11-16 11:36:44,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185992023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:44,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566739052] [2022-11-16 11:36:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:44,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:44,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:44,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:36:44,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:36:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:44,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:36:44,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:36:44,675 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-16 11:36:44,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:36:44,694 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-16 11:36:44,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566739052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:36:44,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:36:44,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-16 11:36:44,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602165723] [2022-11-16 11:36:44,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:36:44,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:36:44,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:44,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:36:44,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:36:44,698 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-16 11:36:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:45,128 INFO L93 Difference]: Finished difference Result 325 states and 606 transitions. [2022-11-16 11:36:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:36:45,129 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-16 11:36:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:45,131 INFO L225 Difference]: With dead ends: 325 [2022-11-16 11:36:45,131 INFO L226 Difference]: Without dead ends: 325 [2022-11-16 11:36:45,131 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-16 11:36:45,132 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:45,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:36:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-16 11:36:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-11-16 11:36:45,170 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-16 11:36:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 606 transitions. [2022-11-16 11:36:45,172 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 606 transitions. Word has length 3 [2022-11-16 11:36:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:45,173 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 606 transitions. [2022-11-16 11:36:45,173 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-16 11:36:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 606 transitions. [2022-11-16 11:36:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:36:45,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:45,174 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-16 11:36:45,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:36:45,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:45,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash -373243545, now seen corresponding path program 2 times [2022-11-16 11:36:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:45,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456812098] [2022-11-16 11:36:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:45,611 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-16 11:36:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:45,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456812098] [2022-11-16 11:36:45,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456812098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:45,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761860460] [2022-11-16 11:36:45,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:36:45,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:45,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:45,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:36:45,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:36:45,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:36:45,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:36:45,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:36:45,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:36:45,798 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-16 11:36:45,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:36:45,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761860460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:45,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:36:45,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-16 11:36:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749111700] [2022-11-16 11:36:45,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:45,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:45,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:45,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:36:45,809 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-16 11:36:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:45,995 INFO L93 Difference]: Finished difference Result 293 states and 544 transitions. [2022-11-16 11:36:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:45,995 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-16 11:36:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:45,997 INFO L225 Difference]: With dead ends: 293 [2022-11-16 11:36:45,997 INFO L226 Difference]: Without dead ends: 293 [2022-11-16 11:36:45,997 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-16 11:36:45,998 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:45,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:36:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-16 11:36:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-11-16 11:36:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 216 states have (on average 2.5185185185185186) internal successors, (544), 292 states have internal predecessors, (544), 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-16 11:36:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 544 transitions. [2022-11-16 11:36:46,011 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 544 transitions. Word has length 6 [2022-11-16 11:36:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:46,012 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 544 transitions. [2022-11-16 11:36:46,013 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-16 11:36:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 544 transitions. [2022-11-16 11:36:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:36:46,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:46,018 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-16 11:36:46,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:36:46,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:46,224 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash -373243543, now seen corresponding path program 1 times [2022-11-16 11:36:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:46,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890970829] [2022-11-16 11:36:46,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:46,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:46,378 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-16 11:36:46,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:46,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890970829] [2022-11-16 11:36:46,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890970829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:46,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541085087] [2022-11-16 11:36:46,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:46,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:46,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:46,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:36:46,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:36:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:46,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:36:46,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:36:46,526 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-16 11:36:46,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:36:46,599 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-16 11:36:46,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541085087] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:36:46,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:36:46,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-16 11:36:46,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975957213] [2022-11-16 11:36:46,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:36:46,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:36:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:46,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:36:46,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:36:46,602 INFO L87 Difference]: Start difference. First operand 293 states and 544 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-16 11:36:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:46,966 INFO L93 Difference]: Finished difference Result 299 states and 550 transitions. [2022-11-16 11:36:46,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:36:46,968 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-16 11:36:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:46,970 INFO L225 Difference]: With dead ends: 299 [2022-11-16 11:36:46,970 INFO L226 Difference]: Without dead ends: 299 [2022-11-16 11:36:46,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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-16 11:36:46,971 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:46,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:36:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-16 11:36:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-11-16 11:36:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 222 states have (on average 2.4774774774774775) internal successors, (550), 298 states have internal predecessors, (550), 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-16 11:36:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 550 transitions. [2022-11-16 11:36:46,988 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 550 transitions. Word has length 6 [2022-11-16 11:36:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:46,988 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 550 transitions. [2022-11-16 11:36:46,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-16 11:36:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 550 transitions. [2022-11-16 11:36:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:36:46,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:46,991 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1] [2022-11-16 11:36:47,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:36:47,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:47,196 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1637360279, now seen corresponding path program 2 times [2022-11-16 11:36:47,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:47,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679812430] [2022-11-16 11:36:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:47,535 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-16 11:36:47,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:47,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679812430] [2022-11-16 11:36:47,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679812430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:47,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:47,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:36:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419828562] [2022-11-16 11:36:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:47,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:47,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:47,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:47,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:36:47,538 INFO L87 Difference]: Start difference. First operand 299 states and 550 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-16 11:36:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:47,712 INFO L93 Difference]: Finished difference Result 298 states and 549 transitions. [2022-11-16 11:36:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:47,712 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 12 [2022-11-16 11:36:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:47,714 INFO L225 Difference]: With dead ends: 298 [2022-11-16 11:36:47,714 INFO L226 Difference]: Without dead ends: 298 [2022-11-16 11:36:47,714 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-16 11:36:47,715 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:47,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:36:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-16 11:36:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-11-16 11:36:47,723 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-16 11:36:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 549 transitions. [2022-11-16 11:36:47,725 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 549 transitions. Word has length 12 [2022-11-16 11:36:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:47,725 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 549 transitions. [2022-11-16 11:36:47,726 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-16 11:36:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 549 transitions. [2022-11-16 11:36:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:36:47,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:47,726 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-16 11:36:47,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:36:47,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:47,728 INFO L85 PathProgramCache]: Analyzing trace with hash -655285955, now seen corresponding path program 1 times [2022-11-16 11:36:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:47,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336006113] [2022-11-16 11:36:47,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:47,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:47,862 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-16 11:36:47,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:47,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336006113] [2022-11-16 11:36:47,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336006113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:47,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:47,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:36:47,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659680503] [2022-11-16 11:36:47,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:47,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:47,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:47,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:36:47,871 INFO L87 Difference]: Start difference. First operand 298 states and 549 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-16 11:36:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:48,106 INFO L93 Difference]: Finished difference Result 500 states and 906 transitions. [2022-11-16 11:36:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:48,107 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-16 11:36:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:48,109 INFO L225 Difference]: With dead ends: 500 [2022-11-16 11:36:48,109 INFO L226 Difference]: Without dead ends: 500 [2022-11-16 11:36:48,110 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-16 11:36:48,111 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:48,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:36:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-11-16 11:36:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 296. [2022-11-16 11:36:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 220 states have (on average 2.477272727272727) internal successors, (545), 295 states have internal predecessors, (545), 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-16 11:36:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 545 transitions. [2022-11-16 11:36:48,122 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 545 transitions. Word has length 15 [2022-11-16 11:36:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:48,123 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 545 transitions. [2022-11-16 11:36:48,123 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-16 11:36:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 545 transitions. [2022-11-16 11:36:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:36:48,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:48,124 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-16 11:36:48,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:36:48,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:48,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash -655285709, now seen corresponding path program 1 times [2022-11-16 11:36:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:48,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433792104] [2022-11-16 11:36:48,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:48,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:49,915 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-16 11:36:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:49,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433792104] [2022-11-16 11:36:49,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433792104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:49,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:49,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:36:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226116530] [2022-11-16 11:36:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:49,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:36:49,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:36:49,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:36:49,919 INFO L87 Difference]: Start difference. First operand 296 states and 545 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-16 11:36:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:50,180 INFO L93 Difference]: Finished difference Result 292 states and 536 transitions. [2022-11-16 11:36:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:36:50,180 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-16 11:36:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:50,182 INFO L225 Difference]: With dead ends: 292 [2022-11-16 11:36:50,182 INFO L226 Difference]: Without dead ends: 292 [2022-11-16 11:36:50,182 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-16 11:36:50,183 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:50,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:36:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-16 11:36:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-16 11:36:50,192 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-16 11:36:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 536 transitions. [2022-11-16 11:36:50,193 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 536 transitions. Word has length 15 [2022-11-16 11:36:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:50,194 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 536 transitions. [2022-11-16 11:36:50,194 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-16 11:36:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 536 transitions. [2022-11-16 11:36:50,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:36:50,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:50,195 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:50,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:36:50,196 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1160972089, now seen corresponding path program 1 times [2022-11-16 11:36:50,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:50,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870587359] [2022-11-16 11:36:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:52,118 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-16 11:36:52,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:52,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870587359] [2022-11-16 11:36:52,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870587359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:52,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:52,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:36:52,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872100578] [2022-11-16 11:36:52,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:52,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:36:52,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:52,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:36:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:36:52,121 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-16 11:36:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:52,537 INFO L93 Difference]: Finished difference Result 290 states and 532 transitions. [2022-11-16 11:36:52,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:36:52,538 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-16 11:36:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:52,540 INFO L225 Difference]: With dead ends: 290 [2022-11-16 11:36:52,540 INFO L226 Difference]: Without dead ends: 290 [2022-11-16 11:36:52,540 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-16 11:36:52,541 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:52,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:36:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-16 11:36:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-11-16 11:36:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 215 states have (on average 2.474418604651163) internal successors, (532), 289 states have internal predecessors, (532), 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-16 11:36:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 532 transitions. [2022-11-16 11:36:52,550 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 532 transitions. Word has length 16 [2022-11-16 11:36:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:52,551 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 532 transitions. [2022-11-16 11:36:52,551 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-16 11:36:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 532 transitions. [2022-11-16 11:36:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:36:52,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:52,552 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:52,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:36:52,553 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:52,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1160972444, now seen corresponding path program 1 times [2022-11-16 11:36:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:52,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076963590] [2022-11-16 11:36:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:55,292 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-16 11:36:55,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:55,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076963590] [2022-11-16 11:36:55,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076963590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:55,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:55,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:36:55,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706314425] [2022-11-16 11:36:55,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:55,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:36:55,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:55,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:36:55,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:36:55,296 INFO L87 Difference]: Start difference. First operand 290 states and 532 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-16 11:36:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:55,742 INFO L93 Difference]: Finished difference Result 286 states and 523 transitions. [2022-11-16 11:36:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:36:55,742 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-16 11:36:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:55,744 INFO L225 Difference]: With dead ends: 286 [2022-11-16 11:36:55,744 INFO L226 Difference]: Without dead ends: 286 [2022-11-16 11:36:55,744 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-16 11:36:55,745 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 48 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:55,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:36:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-16 11:36:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-11-16 11:36:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 212 states have (on average 2.4669811320754715) internal successors, (523), 285 states have internal predecessors, (523), 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-16 11:36:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 523 transitions. [2022-11-16 11:36:55,755 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 523 transitions. Word has length 16 [2022-11-16 11:36:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:55,756 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 523 transitions. [2022-11-16 11:36:55,756 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-16 11:36:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 523 transitions. [2022-11-16 11:36:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:36:55,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:55,758 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:55,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:36:55,758 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1161054247, now seen corresponding path program 1 times [2022-11-16 11:36:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:55,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355576933] [2022-11-16 11:36:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:55,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:55,869 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-16 11:36:55,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:55,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355576933] [2022-11-16 11:36:55,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355576933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:55,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:55,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:36:55,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447925474] [2022-11-16 11:36:55,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:55,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:55,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:55,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:55,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:36:55,872 INFO L87 Difference]: Start difference. First operand 286 states and 523 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-16 11:36:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:56,208 INFO L93 Difference]: Finished difference Result 326 states and 583 transitions. [2022-11-16 11:36:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:56,209 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-16 11:36:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:56,211 INFO L225 Difference]: With dead ends: 326 [2022-11-16 11:36:56,211 INFO L226 Difference]: Without dead ends: 326 [2022-11-16 11:36:56,211 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-16 11:36:56,212 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:56,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 6 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:36:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-16 11:36:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 274. [2022-11-16 11:36:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 208 states have (on average 2.485576923076923) internal successors, (517), 273 states have internal predecessors, (517), 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-16 11:36:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 517 transitions. [2022-11-16 11:36:56,221 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 517 transitions. Word has length 16 [2022-11-16 11:36:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:56,221 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 517 transitions. [2022-11-16 11:36:56,222 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-16 11:36:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 517 transitions. [2022-11-16 11:36:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:36:56,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:56,223 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:56,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:36:56,224 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1161054299, now seen corresponding path program 1 times [2022-11-16 11:36:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:56,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616701488] [2022-11-16 11:36:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:56,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:56,459 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-16 11:36:56,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:56,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616701488] [2022-11-16 11:36:56,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616701488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:56,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:56,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:36:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446096356] [2022-11-16 11:36:56,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:56,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:36:56,462 INFO L87 Difference]: Start difference. First operand 274 states and 517 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-16 11:36:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:56,738 INFO L93 Difference]: Finished difference Result 259 states and 486 transitions. [2022-11-16 11:36:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:56,739 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-16 11:36:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:56,740 INFO L225 Difference]: With dead ends: 259 [2022-11-16 11:36:56,741 INFO L226 Difference]: Without dead ends: 259 [2022-11-16 11:36:56,741 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-16 11:36:56,741 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:56,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 8 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:36:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-16 11:36:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-11-16 11:36:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 200 states have (on average 2.43) internal successors, (486), 258 states have internal predecessors, (486), 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-16 11:36:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 486 transitions. [2022-11-16 11:36:56,753 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 486 transitions. Word has length 16 [2022-11-16 11:36:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:56,753 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 486 transitions. [2022-11-16 11:36:56,754 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-16 11:36:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 486 transitions. [2022-11-16 11:36:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:36:56,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:56,756 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:56,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:36:56,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1630406578, now seen corresponding path program 1 times [2022-11-16 11:36:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749686498] [2022-11-16 11:36:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:58,819 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-16 11:36:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:58,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749686498] [2022-11-16 11:36:58,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749686498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:58,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:58,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:36:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683832557] [2022-11-16 11:36:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:58,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:36:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:36:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:36:58,822 INFO L87 Difference]: Start difference. First operand 259 states and 486 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-16 11:36:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:59,445 INFO L93 Difference]: Finished difference Result 351 states and 648 transitions. [2022-11-16 11:36:59,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:36:59,446 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-16 11:36:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:59,447 INFO L225 Difference]: With dead ends: 351 [2022-11-16 11:36:59,448 INFO L226 Difference]: Without dead ends: 351 [2022-11-16 11:36:59,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:36:59,448 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 92 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:59,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 12 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:36:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-16 11:36:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 269. [2022-11-16 11:36:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 210 states have (on average 2.4047619047619047) internal successors, (505), 268 states have internal predecessors, (505), 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-16 11:36:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 505 transitions. [2022-11-16 11:36:59,467 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 505 transitions. Word has length 17 [2022-11-16 11:36:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:59,467 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 505 transitions. [2022-11-16 11:36:59,468 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-16 11:36:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 505 transitions. [2022-11-16 11:36:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:36:59,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:59,469 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:59,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:36:59,469 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:36:59,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1630829305, now seen corresponding path program 1 times [2022-11-16 11:36:59,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:59,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414159217] [2022-11-16 11:36:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:59,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:59,856 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-16 11:36:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:59,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414159217] [2022-11-16 11:36:59,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414159217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:59,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:59,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:36:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87079378] [2022-11-16 11:36:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:59,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:36:59,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:59,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:36:59,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:36:59,859 INFO L87 Difference]: Start difference. First operand 269 states and 505 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-16 11:37:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:00,232 INFO L93 Difference]: Finished difference Result 343 states and 614 transitions. [2022-11-16 11:37:00,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:37:00,233 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-16 11:37:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:00,235 INFO L225 Difference]: With dead ends: 343 [2022-11-16 11:37:00,235 INFO L226 Difference]: Without dead ends: 343 [2022-11-16 11:37:00,235 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-16 11:37:00,236 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:00,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 6 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:37:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-16 11:37:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 255. [2022-11-16 11:37:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 204 states have (on average 2.343137254901961) internal successors, (478), 254 states have internal predecessors, (478), 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-16 11:37:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 478 transitions. [2022-11-16 11:37:00,245 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 478 transitions. Word has length 17 [2022-11-16 11:37:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:00,245 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 478 transitions. [2022-11-16 11:37:00,246 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-16 11:37:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 478 transitions. [2022-11-16 11:37:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:37:00,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:00,247 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:00,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:37:00,247 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-16 11:37:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1632943920, now seen corresponding path program 1 times [2022-11-16 11:37:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:00,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455518666] [2022-11-16 11:37:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:37:00,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:37:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:37:00,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:37:00,437 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:37:00,439 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 52 remaining) [2022-11-16 11:37:00,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 52 remaining) [2022-11-16 11:37:00,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 52 remaining) [2022-11-16 11:37:00,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 52 remaining) [2022-11-16 11:37:00,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 52 remaining) [2022-11-16 11:37:00,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 52 remaining) [2022-11-16 11:37:00,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 52 remaining) [2022-11-16 11:37:00,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 52 remaining) [2022-11-16 11:37:00,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 52 remaining) [2022-11-16 11:37:00,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 52 remaining) [2022-11-16 11:37:00,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 52 remaining) [2022-11-16 11:37:00,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 52 remaining) [2022-11-16 11:37:00,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 52 remaining) [2022-11-16 11:37:00,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 52 remaining) [2022-11-16 11:37:00,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 52 remaining) [2022-11-16 11:37:00,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 52 remaining) [2022-11-16 11:37:00,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 52 remaining) [2022-11-16 11:37:00,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 52 remaining) [2022-11-16 11:37:00,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 52 remaining) [2022-11-16 11:37:00,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 52 remaining) [2022-11-16 11:37:00,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 52 remaining) [2022-11-16 11:37:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 52 remaining) [2022-11-16 11:37:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 52 remaining) [2022-11-16 11:37:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 52 remaining) [2022-11-16 11:37:00,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 52 remaining) [2022-11-16 11:37:00,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 52 remaining) [2022-11-16 11:37:00,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 52 remaining) [2022-11-16 11:37:00,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (24 of 52 remaining) [2022-11-16 11:37:00,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 52 remaining) [2022-11-16 11:37:00,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 52 remaining) [2022-11-16 11:37:00,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 52 remaining) [2022-11-16 11:37:00,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 52 remaining) [2022-11-16 11:37:00,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 52 remaining) [2022-11-16 11:37:00,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 52 remaining) [2022-11-16 11:37:00,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 52 remaining) [2022-11-16 11:37:00,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 52 remaining) [2022-11-16 11:37:00,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 52 remaining) [2022-11-16 11:37:00,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 52 remaining) [2022-11-16 11:37:00,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 52 remaining) [2022-11-16 11:37:00,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 52 remaining) [2022-11-16 11:37:00,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 52 remaining) [2022-11-16 11:37:00,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 52 remaining) [2022-11-16 11:37:00,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 52 remaining) [2022-11-16 11:37:00,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 52 remaining) [2022-11-16 11:37:00,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 52 remaining) [2022-11-16 11:37:00,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 52 remaining) [2022-11-16 11:37:00,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 52 remaining) [2022-11-16 11:37:00,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 52 remaining) [2022-11-16 11:37:00,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 52 remaining) [2022-11-16 11:37:00,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 52 remaining) [2022-11-16 11:37:00,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 52 remaining) [2022-11-16 11:37:00,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 52 remaining) [2022-11-16 11:37:00,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:37:00,457 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:00,464 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:37:00,465 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:37:00,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:37:00 BasicIcfg [2022-11-16 11:37:00,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:37:00,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:37:00,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:37:00,531 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:37:00,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:34:38" (3/4) ... [2022-11-16 11:37:00,534 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:37:00,611 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:37:00,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:37:00,612 INFO L158 Benchmark]: Toolchain (without parser) took 144440.91ms. Allocated memory was 125.8MB in the beginning and 423.6MB in the end (delta: 297.8MB). Free memory was 90.0MB in the beginning and 197.7MB in the end (delta: -107.7MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. [2022-11-16 11:37:00,612 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory is still 43.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:37:00,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1091.01ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 70.6MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-16 11:37:00,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.16ms. Allocated memory is still 125.8MB. Free memory was 70.6MB in the beginning and 68.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:37:00,614 INFO L158 Benchmark]: Boogie Preprocessor took 51.73ms. Allocated memory is still 125.8MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:37:00,616 INFO L158 Benchmark]: RCFGBuilder took 817.24ms. Allocated memory is still 125.8MB. Free memory was 65.4MB in the beginning and 88.2MB in the end (delta: -22.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-11-16 11:37:00,616 INFO L158 Benchmark]: TraceAbstraction took 142310.61ms. Allocated memory was 125.8MB in the beginning and 423.6MB in the end (delta: 297.8MB). Free memory was 87.0MB in the beginning and 203.0MB in the end (delta: -116.0MB). Peak memory consumption was 180.6MB. Max. memory is 16.1GB. [2022-11-16 11:37:00,616 INFO L158 Benchmark]: Witness Printer took 80.41ms. Allocated memory is still 423.6MB. Free memory was 203.0MB in the beginning and 197.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 11:37:00,619 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory is still 43.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1091.01ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 70.6MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.16ms. Allocated memory is still 125.8MB. Free memory was 70.6MB in the beginning and 68.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.73ms. Allocated memory is still 125.8MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 817.24ms. Allocated memory is still 125.8MB. Free memory was 65.4MB in the beginning and 88.2MB in the end (delta: -22.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 142310.61ms. Allocated memory was 125.8MB in the beginning and 423.6MB in the end (delta: 297.8MB). Free memory was 87.0MB in the beginning and 203.0MB in the end (delta: -116.0MB). Peak memory consumption was 180.6MB. Max. memory is 16.1GB. * Witness Printer took 80.41ms. Allocated memory is still 423.6MB. Free memory was 203.0MB in the beginning and 197.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 124.8s, 190 PlacesBefore, 64 PlacesAfterwards, 190 TransitionsBefore, 61 TransitionsAfterwards, 3136 CoEnabledTransitionPairs, 8 FixpointIterations, 166 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 262 TotalNumberOfCompositions, 11648 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4920, independent: 4465, independent conditional: 0, independent unconditional: 4465, dependent: 455, dependent conditional: 0, dependent unconditional: 455, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2314, independent: 2231, independent conditional: 0, independent unconditional: 2231, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2314, independent: 2171, independent conditional: 0, independent unconditional: 2171, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 143, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 412, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 292, dependent conditional: 0, dependent unconditional: 292, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4920, independent: 2234, independent conditional: 0, independent unconditional: 2234, dependent: 372, dependent conditional: 0, dependent unconditional: 372, unknown: 2314, unknown conditional: 0, unknown unconditional: 2314] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 229, Positive conditional cache size: 0, Positive unconditional cache size: 229, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, 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: [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1256] 0 int i = 0; VAL [c={2:0}, i=0] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=1] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=2] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=3] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=4] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=5] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=6] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=7] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=8] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=9] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={2:0}, i=10] [L1256] COND FALSE 0 !(i < 10) [L1258] 0 int j = __VERIFIER_nondet_int(); [L1259] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1259] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1260] 0 struct s *p; [L1261] 0 pthread_t t1; [L1262] CALL, EXPR 0 new(1) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1262] RET, EXPR 0 new(1) [L1262] 0 c.slots[j] = new(1) [L1263] CALL, EXPR 0 new(2) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1263] RET, EXPR 0 new(2) [L1263] EXPR 0 c.slots[j] [L1263] CALL 0 list_add(new(2), c.slots[j]) [L1243] EXPR 0 list->next [L1243] 0 struct s *temp = list->next; [L1244] 0 list->next = node [L1245] 0 node->next = temp [L1263] RET 0 list_add(new(2), c.slots[j]) [L1264] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [c={2:0}, i=10, j=9, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={11:0}] [L1248] 1 int i = __VERIFIER_nondet_int(); [L1249] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1249] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1251] CALL, EXPR 1 new(3) [L1237] 1 struct s *p = malloc(sizeof(struct s)); VAL [\old(x)=2, \old(x)=3, \result={9:0}, c={2:0}, malloc(sizeof(struct s))={6:0}, p={9:0}, p={6:0}, x=3, x=2] [L1238] 1 p->datum = x VAL [\old(x)=2, \old(x)=3, \result={9:0}, c={2:0}, p={9:0}, p={6:0}, x=3, x=2] [L1239] 1 p->next = ((void *)0) [L1240] 1 return p; [L1251] RET, EXPR 1 new(3) [L1251] EXPR 1 c.slots[i] [L1251] CALL 1 list_add(new(3), c.slots[i]) [L1243] 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: 1255]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1264]: 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, 244 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 142.1s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 124.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 486 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1275 IncrementalHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 66 mSDtfsCounter, 1275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=0, InterpolantAutomatonStates: 68, 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, 14 MinimizatonAttempts, 426 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 191 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 1535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 505/548 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-16 11:37:00,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425da7c9-4f92-4a83-b362-e42b5eaa4453/bin/uautomizer-tPACEb0tL8/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)