./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro --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 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 --- 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-8393723 [2022-11-18 21:10:45,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:10:45,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:10:45,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:10:45,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:10:45,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:10:45,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:10:45,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:10:45,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:10:45,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:10:45,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:10:45,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:10:45,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:10:45,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:10:45,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:10:45,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:10:45,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:10:45,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:10:45,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:10:45,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:10:45,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:10:45,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:10:45,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:10:45,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:10:45,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:10:45,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:10:45,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:10:45,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:10:45,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:10:45,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:10:45,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:10:45,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:10:45,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:10:45,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:10:45,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:10:45,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:10:45,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:10:45,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:10:45,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:10:45,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:10:45,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:10:45,887 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 21:10:45,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:10:45,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:10:45,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:10:45,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:10:45,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:10:45,917 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:10:45,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:10:45,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:10:45,919 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:10:45,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:10:45,920 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:10:45,920 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 21:10:45,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:10:45,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:10:45,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:10:45,921 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 21:10:45,922 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 21:10:45,922 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 21:10:45,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:10:45,922 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 21:10:45,923 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:10:45,923 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:10:45,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:10:45,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:10:45,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:10:45,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:10:45,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:10:45,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:10:45,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:10:45,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:10:45,926 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_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/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_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro 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 -> 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 [2022-11-18 21:10:46,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:10:46,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:10:46,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:10:46,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:10:46,322 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:10:46,324 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2022-11-18 21:10:46,430 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data/3bf6a602d/12344f208dc642b888a342bce8b0d4ee/FLAGb963d38d0 [2022-11-18 21:10:47,067 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:10:47,068 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2022-11-18 21:10:47,099 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data/3bf6a602d/12344f208dc642b888a342bce8b0d4ee/FLAGb963d38d0 [2022-11-18 21:10:47,276 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data/3bf6a602d/12344f208dc642b888a342bce8b0d4ee [2022-11-18 21:10:47,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:10:47,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:10:47,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:10:47,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:10:47,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:10:47,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:10:47" (1/1) ... [2022-11-18 21:10:47,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad403d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:47, skipping insertion in model container [2022-11-18 21:10:47,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:10:47" (1/1) ... [2022-11-18 21:10:47,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:10:47,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:10:47,617 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/sv-benchmarks/c/pthread-wmm/mix000.oepc.i[988,1001] [2022-11-18 21:10:47,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:10:47,936 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:10:47,962 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/sv-benchmarks/c/pthread-wmm/mix000.oepc.i[988,1001] [2022-11-18 21:10:48,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:10:48,063 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:10:48,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48 WrapperNode [2022-11-18 21:10:48,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:10:48,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:10:48,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:10:48,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:10:48,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,130 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-11-18 21:10:48,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:10:48,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:10:48,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:10:48,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:10:48,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,163 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:10:48,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:10:48,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:10:48,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:10:48,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (1/1) ... [2022-11-18 21:10:48,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:10:48,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:10:48,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:10:48,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:10:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 21:10:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 21:10:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:10:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:10:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:10:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 21:10:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 21:10:48,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 21:10:48,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 21:10:48,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:10:48,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 21:10:48,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:10:48,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:10:48,268 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 21:10:48,549 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:10:48,552 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:10:48,928 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:10:49,133 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:10:49,133 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 21:10:49,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:10:49 BoogieIcfgContainer [2022-11-18 21:10:49,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:10:49,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:10:49,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:10:49,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:10:49,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:10:47" (1/3) ... [2022-11-18 21:10:49,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcfc61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:10:49, skipping insertion in model container [2022-11-18 21:10:49,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:48" (2/3) ... [2022-11-18 21:10:49,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcfc61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:10:49, skipping insertion in model container [2022-11-18 21:10:49,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:10:49" (3/3) ... [2022-11-18 21:10:49,163 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2022-11-18 21:10:49,190 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:10:49,191 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-18 21:10:49,191 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 21:10:49,295 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 21:10:49,350 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 21:10:49,375 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 107 transitions, 224 flow [2022-11-18 21:10:49,386 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 107 transitions, 224 flow [2022-11-18 21:10:49,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 224 flow [2022-11-18 21:10:49,476 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-11-18 21:10:49,476 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:10:49,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-18 21:10:49,484 INFO L119 LiptonReduction]: Number of co-enabled transitions 1462 [2022-11-18 21:10:55,856 INFO L134 LiptonReduction]: Checked pairs total: 4323 [2022-11-18 21:10:55,857 INFO L136 LiptonReduction]: Total number of compositions: 110 [2022-11-18 21:10:55,869 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 62 flow [2022-11-18 21:10:55,944 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 254 states, 243 states have (on average 2.4979423868312756) internal successors, (607), 253 states have internal predecessors, (607), 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-18 21:10:55,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:10:55,988 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;@79696572, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:10:55,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-18 21:10:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 254 states, 243 states have (on average 2.4979423868312756) internal successors, (607), 253 states have internal predecessors, (607), 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-18 21:10:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 21:10:55,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:56,000 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 21:10:56,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:10:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 505, now seen corresponding path program 1 times [2022-11-18 21:10:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:56,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879092120] [2022-11-18 21:10:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:56,176 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-18 21:10:56,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:56,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879092120] [2022-11-18 21:10:56,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879092120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:56,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:56,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 21:10:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450178732] [2022-11-18 21:10:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:56,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 21:10:56,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:56,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 21:10:56,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 21:10:56,236 INFO L87 Difference]: Start difference. First operand has 254 states, 243 states have (on average 2.4979423868312756) internal successors, (607), 253 states have internal predecessors, (607), 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 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-18 21:10:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:56,337 INFO L93 Difference]: Finished difference Result 238 states and 579 transitions. [2022-11-18 21:10:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 21:10:56,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-18 21:10:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:56,363 INFO L225 Difference]: With dead ends: 238 [2022-11-18 21:10:56,364 INFO L226 Difference]: Without dead ends: 238 [2022-11-18 21:10:56,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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-18 21:10:56,371 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:56,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:10:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-18 21:10:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-11-18 21:10:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 2.484978540772532) internal successors, (579), 237 states have internal predecessors, (579), 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-18 21:10:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 579 transitions. [2022-11-18 21:10:56,454 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 579 transitions. Word has length 1 [2022-11-18 21:10:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:56,455 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 579 transitions. [2022-11-18 21:10:56,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-18 21:10:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 579 transitions. [2022-11-18 21:10:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 21:10:56,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:56,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 21:10:56,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 21:10:56,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:10:56,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash 498011, now seen corresponding path program 1 times [2022-11-18 21:10:56,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:56,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694015457] [2022-11-18 21:10:56,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:56,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:56,867 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-18 21:10:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:56,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694015457] [2022-11-18 21:10:56,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694015457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:56,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:56,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 21:10:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853715874] [2022-11-18 21:10:56,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:56,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:10:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:10:56,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:10:56,874 INFO L87 Difference]: Start difference. First operand 238 states and 579 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-18 21:10:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:56,967 INFO L93 Difference]: Finished difference Result 200 states and 479 transitions. [2022-11-18 21:10:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:10:56,968 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 3 [2022-11-18 21:10:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:56,972 INFO L225 Difference]: With dead ends: 200 [2022-11-18 21:10:56,972 INFO L226 Difference]: Without dead ends: 194 [2022-11-18 21:10:56,973 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-18 21:10:56,974 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:56,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:10:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-18 21:10:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-11-18 21:10:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 2.4375) internal successors, (468), 193 states have internal predecessors, (468), 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-18 21:10:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 468 transitions. [2022-11-18 21:10:56,990 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 468 transitions. Word has length 3 [2022-11-18 21:10:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:56,991 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 468 transitions. [2022-11-18 21:10:56,991 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-18 21:10:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 468 transitions. [2022-11-18 21:10:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 21:10:56,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:56,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:56,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 21:10:56,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:10:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash 422345888, now seen corresponding path program 1 times [2022-11-18 21:10:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:56,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140631265] [2022-11-18 21:10:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:57,307 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-18 21:10:57,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:57,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140631265] [2022-11-18 21:10:57,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140631265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:57,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:57,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 21:10:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813848588] [2022-11-18 21:10:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:57,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:10:57,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:57,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:10:57,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:10:57,310 INFO L87 Difference]: Start difference. First operand 194 states and 468 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-18 21:10:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:57,421 INFO L93 Difference]: Finished difference Result 222 states and 508 transitions. [2022-11-18 21:10:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:10:57,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 7 [2022-11-18 21:10:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:57,426 INFO L225 Difference]: With dead ends: 222 [2022-11-18 21:10:57,426 INFO L226 Difference]: Without dead ends: 222 [2022-11-18 21:10:57,427 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-18 21:10:57,431 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:57,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:10:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-18 21:10:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2022-11-18 21:10:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 2.425531914893617) internal successors, (456), 189 states have internal predecessors, (456), 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-18 21:10:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 456 transitions. [2022-11-18 21:10:57,456 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 456 transitions. Word has length 7 [2022-11-18 21:10:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:57,456 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 456 transitions. [2022-11-18 21:10:57,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-18 21:10:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 456 transitions. [2022-11-18 21:10:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 21:10:57,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:57,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:57,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 21:10:57,458 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:10:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash 422345904, now seen corresponding path program 1 times [2022-11-18 21:10:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:57,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789592625] [2022-11-18 21:10:57,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:57,795 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-18 21:10:57,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:57,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789592625] [2022-11-18 21:10:57,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789592625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:57,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:57,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:10:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985555925] [2022-11-18 21:10:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:57,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:10:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:57,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:10:57,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:10:57,799 INFO L87 Difference]: Start difference. First operand 190 states and 456 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-18 21:10:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:57,908 INFO L93 Difference]: Finished difference Result 278 states and 653 transitions. [2022-11-18 21:10:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:10:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 7 [2022-11-18 21:10:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:57,911 INFO L225 Difference]: With dead ends: 278 [2022-11-18 21:10:57,911 INFO L226 Difference]: Without dead ends: 278 [2022-11-18 21:10:57,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:10:57,912 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:57,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:10:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-18 21:10:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 254. [2022-11-18 21:10:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 252 states have (on average 2.4404761904761907) internal successors, (615), 253 states have internal predecessors, (615), 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-18 21:10:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 615 transitions. [2022-11-18 21:10:57,927 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 615 transitions. Word has length 7 [2022-11-18 21:10:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:57,927 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 615 transitions. [2022-11-18 21:10:57,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-18 21:10:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 615 transitions. [2022-11-18 21:10:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 21:10:57,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:57,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:57,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 21:10:57,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:10:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1393936603, now seen corresponding path program 1 times [2022-11-18 21:10:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:57,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650571074] [2022-11-18 21:10:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:58,215 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-18 21:10:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:58,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650571074] [2022-11-18 21:10:58,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650571074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:58,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:58,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:10:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289710767] [2022-11-18 21:10:58,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:58,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:10:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:58,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:10:58,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:10:58,218 INFO L87 Difference]: Start difference. First operand 254 states and 615 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-18 21:10:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:58,329 INFO L93 Difference]: Finished difference Result 262 states and 609 transitions. [2022-11-18 21:10:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:10:58,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 21:10:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:58,334 INFO L225 Difference]: With dead ends: 262 [2022-11-18 21:10:58,340 INFO L226 Difference]: Without dead ends: 262 [2022-11-18 21:10:58,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:10:58,341 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:58,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:10:58,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-18 21:10:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 246. [2022-11-18 21:10:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 244 states have (on average 2.3975409836065573) internal successors, (585), 245 states have internal predecessors, (585), 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-18 21:10:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 585 transitions. [2022-11-18 21:10:58,356 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 585 transitions. Word has length 9 [2022-11-18 21:10:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:58,356 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 585 transitions. [2022-11-18 21:10:58,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-18 21:10:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 585 transitions. [2022-11-18 21:10:58,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 21:10:58,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:58,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:58,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 21:10:58,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:10:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1475928061, now seen corresponding path program 1 times [2022-11-18 21:10:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:58,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642955344] [2022-11-18 21:10:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:58,785 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-18 21:10:58,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:58,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642955344] [2022-11-18 21:10:58,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642955344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:58,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:58,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:10:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320604996] [2022-11-18 21:10:58,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:58,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:10:58,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:58,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:10:58,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:10:58,793 INFO L87 Difference]: Start difference. First operand 246 states and 585 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-18 21:10:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:58,877 INFO L93 Difference]: Finished difference Result 222 states and 523 transitions. [2022-11-18 21:10:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:10:58,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 21:10:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:58,880 INFO L225 Difference]: With dead ends: 222 [2022-11-18 21:10:58,880 INFO L226 Difference]: Without dead ends: 222 [2022-11-18 21:10:58,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:10:58,881 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:58,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:10:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-18 21:10:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 146. [2022-11-18 21:10:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.331034482758621) internal successors, (338), 145 states have internal predecessors, (338), 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-18 21:10:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 338 transitions. [2022-11-18 21:10:58,889 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 338 transitions. Word has length 9 [2022-11-18 21:10:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:58,889 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 338 transitions. [2022-11-18 21:10:58,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-18 21:10:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 338 transitions. [2022-11-18 21:10:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 21:10:58,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:58,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:58,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 21:10:58,891 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:10:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2147426407, now seen corresponding path program 1 times [2022-11-18 21:10:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:58,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633195760] [2022-11-18 21:10:58,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:59,071 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-18 21:10:59,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:59,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633195760] [2022-11-18 21:10:59,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633195760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:59,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:59,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:10:59,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47819907] [2022-11-18 21:10:59,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:59,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:10:59,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:10:59,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:10:59,074 INFO L87 Difference]: Start difference. First operand 146 states and 338 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-18 21:10:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:59,139 INFO L93 Difference]: Finished difference Result 138 states and 316 transitions. [2022-11-18 21:10:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:10:59,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 21:10:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:59,141 INFO L225 Difference]: With dead ends: 138 [2022-11-18 21:10:59,141 INFO L226 Difference]: Without dead ends: 138 [2022-11-18 21:10:59,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:10:59,142 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:59,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:10:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-18 21:10:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-18 21:10:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.3065693430656933) internal successors, (316), 137 states have internal predecessors, (316), 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-18 21:10:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 316 transitions. [2022-11-18 21:10:59,147 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 316 transitions. Word has length 9 [2022-11-18 21:10:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:59,148 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 316 transitions. [2022-11-18 21:10:59,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-18 21:10:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 316 transitions. [2022-11-18 21:10:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 21:10:59,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:59,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:59,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 21:10:59,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:10:59,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash -455404556, now seen corresponding path program 1 times [2022-11-18 21:10:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:59,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826430334] [2022-11-18 21:10:59,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:59,379 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-18 21:10:59,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:59,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826430334] [2022-11-18 21:10:59,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826430334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:59,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:59,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:10:59,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592352311] [2022-11-18 21:10:59,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:59,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:10:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:10:59,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:10:59,382 INFO L87 Difference]: Start difference. First operand 138 states and 316 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-18 21:10:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:59,548 INFO L93 Difference]: Finished difference Result 115 states and 224 transitions. [2022-11-18 21:10:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:10:59,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-11-18 21:10:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:59,553 INFO L225 Difference]: With dead ends: 115 [2022-11-18 21:10:59,553 INFO L226 Difference]: Without dead ends: 79 [2022-11-18 21:10:59,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:10:59,554 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:59,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 10 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:10:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-18 21:10:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-18 21:10:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 78 states have internal predecessors, (139), 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-18 21:10:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2022-11-18 21:10:59,559 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 11 [2022-11-18 21:10:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:59,560 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2022-11-18 21:10:59,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-18 21:10:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-11-18 21:10:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 21:10:59,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:59,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:59,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 21:10:59,562 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:10:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1604595563, now seen corresponding path program 1 times [2022-11-18 21:10:59,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:59,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034508309] [2022-11-18 21:10:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:59,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:00,109 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-18 21:11:00,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:00,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034508309] [2022-11-18 21:11:00,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034508309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:00,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:00,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:11:00,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200159432] [2022-11-18 21:11:00,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:00,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:11:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:00,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:11:00,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:11:00,112 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-18 21:11:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:00,239 INFO L93 Difference]: Finished difference Result 64 states and 107 transitions. [2022-11-18 21:11:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 21:11:00,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 14 [2022-11-18 21:11:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:00,241 INFO L225 Difference]: With dead ends: 64 [2022-11-18 21:11:00,241 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 21:11:00,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:11:00,242 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:00,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 10 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:11:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 21:11:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-18 21:11:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 52 states have internal predecessors, (87), 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-18 21:11:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 87 transitions. [2022-11-18 21:11:00,245 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 87 transitions. Word has length 14 [2022-11-18 21:11:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:00,246 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 87 transitions. [2022-11-18 21:11:00,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-18 21:11:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 87 transitions. [2022-11-18 21:11:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:11:00,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:00,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:00,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 21:11:00,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:00,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash -94092869, now seen corresponding path program 1 times [2022-11-18 21:11:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:00,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098748018] [2022-11-18 21:11:00,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:00,563 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-18 21:11:00,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:00,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098748018] [2022-11-18 21:11:00,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098748018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:00,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:00,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:11:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471233560] [2022-11-18 21:11:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:00,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:11:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:11:00,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:11:00,567 INFO L87 Difference]: Start difference. First operand 53 states and 87 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:00,690 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-11-18 21:11:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:11:00,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-18 21:11:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:00,691 INFO L225 Difference]: With dead ends: 70 [2022-11-18 21:11:00,691 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 21:11:00,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-18 21:11:00,692 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:00,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:11:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 21:11:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-11-18 21:11:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 43 states have internal predecessors, (69), 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-18 21:11:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 69 transitions. [2022-11-18 21:11:00,698 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 69 transitions. Word has length 17 [2022-11-18 21:11:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:00,698 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 69 transitions. [2022-11-18 21:11:00,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 69 transitions. [2022-11-18 21:11:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:11:00,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:00,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:00,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 21:11:00,700 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash -152866019, now seen corresponding path program 2 times [2022-11-18 21:11:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:00,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088085593] [2022-11-18 21:11:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:01,058 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-18 21:11:01,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:01,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088085593] [2022-11-18 21:11:01,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088085593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:01,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:01,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:11:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43621375] [2022-11-18 21:11:01,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:01,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:11:01,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:01,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:11:01,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:11:01,061 INFO L87 Difference]: Start difference. First operand 44 states and 69 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:01,198 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-11-18 21:11:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 21:11:01,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-18 21:11:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:01,199 INFO L225 Difference]: With dead ends: 61 [2022-11-18 21:11:01,199 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 21:11:01,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:11:01,200 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:01,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:11:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 21:11:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-18 21:11:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 37 states have internal predecessors, (57), 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-18 21:11:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 57 transitions. [2022-11-18 21:11:01,203 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 57 transitions. Word has length 17 [2022-11-18 21:11:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:01,203 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 57 transitions. [2022-11-18 21:11:01,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2022-11-18 21:11:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:11:01,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:01,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:01,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 21:11:01,205 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1650458909, now seen corresponding path program 3 times [2022-11-18 21:11:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:01,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716387211] [2022-11-18 21:11:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:11:01,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:11:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:11:01,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:11:01,376 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:11:01,378 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-18 21:11:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-18 21:11:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-18 21:11:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-18 21:11:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-18 21:11:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-18 21:11:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-18 21:11:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-18 21:11:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-18 21:11:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-18 21:11:01,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 21:11:01,385 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:01,392 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 21:11:01,393 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 21:11:01,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:11:01 BasicIcfg [2022-11-18 21:11:01,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 21:11:01,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 21:11:01,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 21:11:01,472 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 21:11:01,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:10:49" (3/4) ... [2022-11-18 21:11:01,488 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 21:11:01,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 21:11:01,489 INFO L158 Benchmark]: Toolchain (without parser) took 14207.91ms. Allocated memory was 104.9MB in the beginning and 186.6MB in the end (delta: 81.8MB). Free memory was 69.6MB in the beginning and 97.1MB in the end (delta: -27.5MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2022-11-18 21:11:01,489 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 104.9MB. Free memory was 75.9MB in the beginning and 75.9MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:11:01,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 780.81ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 67.7MB in the end (delta: 1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 21:11:01,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.70ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 64.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:11:01,491 INFO L158 Benchmark]: Boogie Preprocessor took 40.26ms. Allocated memory is still 104.9MB. Free memory was 64.7MB in the beginning and 63.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:11:01,491 INFO L158 Benchmark]: RCFGBuilder took 964.07ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 63.1MB in the beginning and 89.2MB in the end (delta: -26.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2022-11-18 21:11:01,491 INFO L158 Benchmark]: TraceAbstraction took 12332.68ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 89.2MB in the beginning and 98.1MB in the end (delta: -8.9MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2022-11-18 21:11:01,492 INFO L158 Benchmark]: Witness Printer took 16.47ms. Allocated memory is still 186.6MB. Free memory was 98.1MB in the beginning and 97.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:11:01,494 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.36ms. Allocated memory is still 104.9MB. Free memory was 75.9MB in the beginning and 75.9MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 780.81ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 67.7MB in the end (delta: 1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.70ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 64.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.26ms. Allocated memory is still 104.9MB. Free memory was 64.7MB in the beginning and 63.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 964.07ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 63.1MB in the beginning and 89.2MB in the end (delta: -26.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12332.68ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 89.2MB in the beginning and 98.1MB in the end (delta: -8.9MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Witness Printer took 16.47ms. Allocated memory is still 186.6MB. Free memory was 98.1MB in the beginning and 97.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 112 PlacesBefore, 33 PlacesAfterwards, 107 TransitionsBefore, 26 TransitionsAfterwards, 1462 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 110 TotalNumberOfCompositions, 4323 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2006, independent: 1835, independent conditional: 0, independent unconditional: 1835, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1069, independent: 1013, independent conditional: 0, independent unconditional: 1013, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1069, independent: 1009, independent conditional: 0, independent unconditional: 1009, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 565, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 554, dependent conditional: 0, dependent unconditional: 554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2006, independent: 822, independent conditional: 0, independent unconditional: 822, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1069, unknown conditional: 0, unknown unconditional: 1069] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L734] 0 int y$w_buff0; [L736] 0 int y$w_buff1; [L711] 0 int __unbuffered_p0_EAX = 0; [L728] 0 _Bool y$r_buff0_thd2; [L725] 0 int y$mem_tmp; [L715] 0 int __unbuffered_p1_EAX = 0; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L724] 0 _Bool y$flush_delayed; [L713] 0 int __unbuffered_p0_EBX = 0; [L737] 0 _Bool y$w_buff1_used; [L719] 0 _Bool main$tmp_guard1; [L718] 0 _Bool main$tmp_guard0; [L717] 0 int __unbuffered_p1_EBX = 0; [L733] 0 int *y$read_delayed_var; [L735] 0 _Bool y$w_buff0_used; [L721] 0 int x = 0; [L729] 0 _Bool y$r_buff1_thd0; [L723] 0 int y = 0; [L731] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$r_buff1_thd1; [L831] 0 pthread_t t0; [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-1, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t1; [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 127 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 504 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 27 mSDtfsCounter, 504 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 154 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 21:11:01,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro --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 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 --- 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-8393723 [2022-11-18 21:11:04,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:11:04,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:11:04,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:11:04,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:11:04,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:11:04,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:11:04,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:11:04,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:11:04,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:11:04,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:11:04,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:11:04,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:11:04,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:11:04,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:11:04,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:11:04,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:11:04,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:11:04,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:11:04,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:11:04,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:11:04,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:11:04,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:11:04,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:11:04,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:11:04,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:11:04,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:11:04,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:11:04,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:11:04,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:11:04,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:11:04,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:11:04,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:11:04,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:11:04,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:11:04,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:11:04,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:11:04,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:11:04,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:11:04,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:11:04,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:11:04,752 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 21:11:04,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:11:04,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:11:04,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:11:04,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:11:04,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:11:04,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:11:04,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:11:04,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:11:04,821 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:11:04,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:11:04,822 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:11:04,823 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 21:11:04,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:11:04,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:11:04,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:11:04,825 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 21:11:04,825 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 21:11:04,826 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 21:11:04,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:11:04,826 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 21:11:04,827 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 21:11:04,827 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 21:11:04,827 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:11:04,828 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:11:04,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:11:04,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:11:04,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:11:04,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:11:04,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:11:04,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:11:04,831 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 21:11:04,831 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 21:11:04,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 21:11:04,832 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/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_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro 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 -> 62286332e049ab35f6bf4022df54bae198ba0ceaf820c98713e2f1f442f473b5 [2022-11-18 21:11:05,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:11:05,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:11:05,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:11:05,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:11:05,378 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:11:05,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2022-11-18 21:11:05,461 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data/2a2231ac6/2507611dae36466eb7b970ceb0e58073/FLAG6e5ca523c [2022-11-18 21:11:06,258 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:11:06,264 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/sv-benchmarks/c/pthread-wmm/mix000.oepc.i [2022-11-18 21:11:06,296 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data/2a2231ac6/2507611dae36466eb7b970ceb0e58073/FLAG6e5ca523c [2022-11-18 21:11:06,430 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/data/2a2231ac6/2507611dae36466eb7b970ceb0e58073 [2022-11-18 21:11:06,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:11:06,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:11:06,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:11:06,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:11:06,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:11:06,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:11:06" (1/1) ... [2022-11-18 21:11:06,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2698ed4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:06, skipping insertion in model container [2022-11-18 21:11:06,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:11:06" (1/1) ... [2022-11-18 21:11:06,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:11:06,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:11:06,883 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/sv-benchmarks/c/pthread-wmm/mix000.oepc.i[988,1001] [2022-11-18 21:11:07,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:11:07,305 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:11:07,321 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/sv-benchmarks/c/pthread-wmm/mix000.oepc.i[988,1001] [2022-11-18 21:11:07,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:11:07,449 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:11:07,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07 WrapperNode [2022-11-18 21:11:07,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:11:07,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:11:07,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:11:07,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:11:07,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,525 INFO L138 Inliner]: procedures = 178, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-11-18 21:11:07,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:11:07,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:11:07,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:11:07,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:11:07,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,556 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:11:07,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:11:07,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:11:07,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:11:07,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (1/1) ... [2022-11-18 21:11:07,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:11:07,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:11:07,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:11:07,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:11:07,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 21:11:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:11:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:11:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:11:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 21:11:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 21:11:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 21:11:07,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 21:11:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 21:11:07,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 21:11:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 21:11:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:11:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:11:07,674 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 21:11:07,921 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:11:07,924 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:11:08,481 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:11:08,681 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:11:08,681 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 21:11:08,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:11:08 BoogieIcfgContainer [2022-11-18 21:11:08,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:11:08,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:11:08,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:11:08,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:11:08,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:11:06" (1/3) ... [2022-11-18 21:11:08,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f87ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:11:08, skipping insertion in model container [2022-11-18 21:11:08,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:07" (2/3) ... [2022-11-18 21:11:08,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f87ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:11:08, skipping insertion in model container [2022-11-18 21:11:08,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:11:08" (3/3) ... [2022-11-18 21:11:08,697 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2022-11-18 21:11:08,715 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:11:08,715 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-18 21:11:08,715 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 21:11:08,811 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 21:11:08,870 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 21:11:08,885 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 108 transitions, 226 flow [2022-11-18 21:11:08,888 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 108 transitions, 226 flow [2022-11-18 21:11:08,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 108 transitions, 226 flow [2022-11-18 21:11:08,947 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-11-18 21:11:08,947 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:11:08,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-11-18 21:11:08,957 INFO L119 LiptonReduction]: Number of co-enabled transitions 1462 [2022-11-18 21:11:18,847 INFO L134 LiptonReduction]: Checked pairs total: 4401 [2022-11-18 21:11:18,848 INFO L136 LiptonReduction]: Total number of compositions: 111 [2022-11-18 21:11:18,858 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 66 flow [2022-11-18 21:11:18,915 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 296 states, 285 states have (on average 2.6736842105263157) internal successors, (762), 295 states have internal predecessors, (762), 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-18 21:11:18,957 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:11:18,967 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;@3bc9c03b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:11:18,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-18 21:11:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 285 states have (on average 2.6736842105263157) internal successors, (762), 295 states have internal predecessors, (762), 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-18 21:11:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 21:11:18,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:18,981 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 21:11:18,982 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 508, now seen corresponding path program 1 times [2022-11-18 21:11:19,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:11:19,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528599233] [2022-11-18 21:11:19,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:19,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:19,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:11:19,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:11:19,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 21:11:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 21:11:19,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:19,136 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-18 21:11:19,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:11:19,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:11:19,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528599233] [2022-11-18 21:11:19,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528599233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:19,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:19,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 21:11:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095039493] [2022-11-18 21:11:19,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:19,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 21:11:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:11:19,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 21:11:19,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 21:11:19,184 INFO L87 Difference]: Start difference. First operand has 296 states, 285 states have (on average 2.6736842105263157) internal successors, (762), 295 states have internal predecessors, (762), 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 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-18 21:11:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:19,308 INFO L93 Difference]: Finished difference Result 280 states and 692 transitions. [2022-11-18 21:11:19,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 21:11:19,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-18 21:11:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:19,326 INFO L225 Difference]: With dead ends: 280 [2022-11-18 21:11:19,326 INFO L226 Difference]: Without dead ends: 280 [2022-11-18 21:11:19,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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-18 21:11:19,331 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:19,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:11:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-18 21:11:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-18 21:11:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 2.5163636363636366) internal successors, (692), 279 states have internal predecessors, (692), 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-18 21:11:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 692 transitions. [2022-11-18 21:11:19,467 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 692 transitions. Word has length 1 [2022-11-18 21:11:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:19,471 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 692 transitions. [2022-11-18 21:11:19,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-18 21:11:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 692 transitions. [2022-11-18 21:11:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 21:11:19,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:19,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 21:11:19,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-18 21:11:19,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:19,676 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash 499037, now seen corresponding path program 1 times [2022-11-18 21:11:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:11:19,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146075402] [2022-11-18 21:11:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:19,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:19,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:11:19,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:11:19,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 21:11:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 21:11:19,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:19,789 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-18 21:11:19,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:11:19,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:11:19,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146075402] [2022-11-18 21:11:19,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146075402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:19,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:19,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 21:11:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143490875] [2022-11-18 21:11:19,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:19,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:11:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:11:19,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:11:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:11:19,802 INFO L87 Difference]: Start difference. First operand 280 states and 692 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-18 21:11:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:19,938 INFO L93 Difference]: Finished difference Result 236 states and 575 transitions. [2022-11-18 21:11:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:11:19,939 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 3 [2022-11-18 21:11:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:19,942 INFO L225 Difference]: With dead ends: 236 [2022-11-18 21:11:19,942 INFO L226 Difference]: Without dead ends: 230 [2022-11-18 21:11:19,942 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-18 21:11:19,944 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:19,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:11:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-18 21:11:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-11-18 21:11:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 228 states have (on average 2.473684210526316) internal successors, (564), 229 states have internal predecessors, (564), 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-18 21:11:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 564 transitions. [2022-11-18 21:11:19,966 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 564 transitions. Word has length 3 [2022-11-18 21:11:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:19,966 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 564 transitions. [2022-11-18 21:11:19,967 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-18 21:11:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 564 transitions. [2022-11-18 21:11:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 21:11:19,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:19,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:19,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:20,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:20,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:20,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1371783267, now seen corresponding path program 1 times [2022-11-18 21:11:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:11:20,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913800280] [2022-11-18 21:11:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:20,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:11:20,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:11:20,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 21:11:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:20,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 21:11:20,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:20,347 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-18 21:11:20,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:11:20,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:11:20,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913800280] [2022-11-18 21:11:20,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913800280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:20,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:20,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:11:20,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834165596] [2022-11-18 21:11:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:20,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:11:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:11:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:11:20,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:11:20,351 INFO L87 Difference]: Start difference. First operand 230 states and 564 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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-18 21:11:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:20,515 INFO L93 Difference]: Finished difference Result 141 states and 274 transitions. [2022-11-18 21:11:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:11:20,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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 7 [2022-11-18 21:11:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:20,517 INFO L225 Difference]: With dead ends: 141 [2022-11-18 21:11:20,517 INFO L226 Difference]: Without dead ends: 105 [2022-11-18 21:11:20,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-18 21:11:20,519 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:20,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 10 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:11:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-18 21:11:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-11-18 21:11:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.8349514563106797) internal successors, (189), 104 states have internal predecessors, (189), 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-18 21:11:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 189 transitions. [2022-11-18 21:11:20,527 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 189 transitions. Word has length 7 [2022-11-18 21:11:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:20,528 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 189 transitions. [2022-11-18 21:11:20,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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-18 21:11:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 189 transitions. [2022-11-18 21:11:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 21:11:20,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:20,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:20,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:20,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:20,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:20,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash -69619515, now seen corresponding path program 1 times [2022-11-18 21:11:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:11:20,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477250794] [2022-11-18 21:11:20,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:20,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:20,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:11:20,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:11:20,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 21:11:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:20,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 21:11:20,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:21,026 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-18 21:11:21,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:11:21,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:11:21,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477250794] [2022-11-18 21:11:21,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477250794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:21,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:21,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:11:21,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362439198] [2022-11-18 21:11:21,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:21,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:11:21,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:11:21,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:11:21,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:11:21,028 INFO L87 Difference]: Start difference. First operand 105 states and 189 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-18 21:11:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:21,218 INFO L93 Difference]: Finished difference Result 66 states and 109 transitions. [2022-11-18 21:11:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 21:11:21,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-18 21:11:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:21,219 INFO L225 Difference]: With dead ends: 66 [2022-11-18 21:11:21,220 INFO L226 Difference]: Without dead ends: 55 [2022-11-18 21:11:21,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:11:21,221 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:21,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:11:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-18 21:11:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-18 21:11:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (89), 54 states have internal predecessors, (89), 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-18 21:11:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 89 transitions. [2022-11-18 21:11:21,228 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 89 transitions. Word has length 12 [2022-11-18 21:11:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:21,229 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 89 transitions. [2022-11-18 21:11:21,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-18 21:11:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 89 transitions. [2022-11-18 21:11:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:11:21,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:21,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:21,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:21,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:21,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1310902668, now seen corresponding path program 1 times [2022-11-18 21:11:21,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:11:21,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061900065] [2022-11-18 21:11:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:21,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:21,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:11:21,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:11:21,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 21:11:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:21,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 21:11:21,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:21,633 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-18 21:11:21,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:11:21,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:11:21,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061900065] [2022-11-18 21:11:21,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061900065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:21,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:21,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:11:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7731077] [2022-11-18 21:11:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:21,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:11:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:11:21,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:11:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:11:21,637 INFO L87 Difference]: Start difference. First operand 55 states and 89 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:21,759 INFO L93 Difference]: Finished difference Result 74 states and 115 transitions. [2022-11-18 21:11:21,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:11:21,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-18 21:11:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:21,760 INFO L225 Difference]: With dead ends: 74 [2022-11-18 21:11:21,760 INFO L226 Difference]: Without dead ends: 74 [2022-11-18 21:11:21,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-18 21:11:21,761 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:21,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:11:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-18 21:11:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-11-18 21:11:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 71 states have internal predecessors, (114), 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-18 21:11:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2022-11-18 21:11:21,767 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 17 [2022-11-18 21:11:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:21,767 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2022-11-18 21:11:21,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2022-11-18 21:11:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:11:21,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:21,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:21,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:21,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:21,969 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash 231488062, now seen corresponding path program 2 times [2022-11-18 21:11:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:11:21,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128933196] [2022-11-18 21:11:21,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 21:11:21,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:21,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:11:21,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:11:21,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 21:11:22,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 21:11:22,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:11:22,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 21:11:22,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:22,702 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-18 21:11:22,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:11:22,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:11:22,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128933196] [2022-11-18 21:11:22,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128933196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:22,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:22,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 21:11:22,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113368332] [2022-11-18 21:11:22,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:22,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:11:22,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:11:22,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:11:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:11:22,706 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:23,040 INFO L93 Difference]: Finished difference Result 90 states and 135 transitions. [2022-11-18 21:11:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:11:23,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-18 21:11:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:23,041 INFO L225 Difference]: With dead ends: 90 [2022-11-18 21:11:23,041 INFO L226 Difference]: Without dead ends: 90 [2022-11-18 21:11:23,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:11:23,042 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:23,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 23 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:11:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-18 21:11:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2022-11-18 21:11:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 67 states have internal predecessors, (108), 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-18 21:11:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 108 transitions. [2022-11-18 21:11:23,048 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 108 transitions. Word has length 17 [2022-11-18 21:11:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:23,049 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 108 transitions. [2022-11-18 21:11:23,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 108 transitions. [2022-11-18 21:11:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:11:23,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:23,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:23,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:23,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:23,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 21:11:23,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1402051178, now seen corresponding path program 3 times [2022-11-18 21:11:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:11:23,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330876473] [2022-11-18 21:11:23,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 21:11:23,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:23,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:11:23,266 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:11:23,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 21:11:23,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-18 21:11:23,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 21:11:23,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:11:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:11:23,536 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 21:11:23,536 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:11:23,537 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-18 21:11:23,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-18 21:11:23,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-18 21:11:23,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-18 21:11:23,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-18 21:11:23,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-18 21:11:23,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-18 21:11:23,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-18 21:11:23,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-18 21:11:23,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-18 21:11:23,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:23,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:11:23,744 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-11-18 21:11:23,749 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 21:11:23,749 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 21:11:23,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:11:23 BasicIcfg [2022-11-18 21:11:23,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 21:11:23,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 21:11:23,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 21:11:23,802 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 21:11:23,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:11:08" (3/4) ... [2022-11-18 21:11:23,805 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 21:11:23,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 21:11:23,806 INFO L158 Benchmark]: Toolchain (without parser) took 17369.35ms. Allocated memory was 62.9MB in the beginning and 130.0MB in the end (delta: 67.1MB). Free memory was 41.5MB in the beginning and 43.2MB in the end (delta: -1.6MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2022-11-18 21:11:23,807 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 62.9MB. Free memory was 43.9MB in the beginning and 43.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:11:23,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1010.34ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 33.1MB in the end (delta: 8.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 21:11:23,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.65ms. Allocated memory is still 62.9MB. Free memory was 33.1MB in the beginning and 30.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:11:23,808 INFO L158 Benchmark]: Boogie Preprocessor took 35.59ms. Allocated memory is still 62.9MB. Free memory was 30.3MB in the beginning and 28.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:11:23,808 INFO L158 Benchmark]: RCFGBuilder took 1121.53ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 28.2MB in the beginning and 49.5MB in the end (delta: -21.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2022-11-18 21:11:23,809 INFO L158 Benchmark]: TraceAbstraction took 15114.31ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 48.7MB in the beginning and 43.2MB in the end (delta: 5.5MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2022-11-18 21:11:23,809 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 130.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:11:23,811 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.42ms. Allocated memory is still 62.9MB. Free memory was 43.9MB in the beginning and 43.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1010.34ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 33.1MB in the end (delta: 8.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.65ms. Allocated memory is still 62.9MB. Free memory was 33.1MB in the beginning and 30.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.59ms. Allocated memory is still 62.9MB. Free memory was 30.3MB in the beginning and 28.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1121.53ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 28.2MB in the beginning and 49.5MB in the end (delta: -21.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15114.31ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 48.7MB in the beginning and 43.2MB in the end (delta: 5.5MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 130.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 113 PlacesBefore, 34 PlacesAfterwards, 108 TransitionsBefore, 28 TransitionsAfterwards, 1462 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 4401 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2069, independent: 1905, independent conditional: 0, independent unconditional: 1905, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1092, independent: 1038, independent conditional: 0, independent unconditional: 1038, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1092, independent: 1022, independent conditional: 0, independent unconditional: 1022, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 574, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 536, dependent conditional: 0, dependent unconditional: 536, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2069, independent: 867, independent conditional: 0, independent unconditional: 867, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1092, unknown conditional: 0, unknown unconditional: 1092] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L734] 0 int y$w_buff0; [L736] 0 int y$w_buff1; [L711] 0 int __unbuffered_p0_EAX = 0; [L728] 0 _Bool y$r_buff0_thd2; [L725] 0 int y$mem_tmp; [L715] 0 int __unbuffered_p1_EAX = 0; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L724] 0 _Bool y$flush_delayed; [L713] 0 int __unbuffered_p0_EBX = 0; [L737] 0 _Bool y$w_buff1_used; [L719] 0 _Bool main$tmp_guard1; [L718] 0 _Bool main$tmp_guard0; [L717] 0 int __unbuffered_p1_EBX = 0; [L733] 0 int *y$read_delayed_var; [L735] 0 _Bool y$w_buff0_used; [L721] 0 int x = 0; [L729] 0 _Bool y$r_buff1_thd0; [L723] 0 int y = 0; [L731] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$r_buff1_thd1; [L831] 0 pthread_t t0; [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=0, t0={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t1; [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=1, t0={3:0}, t1={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=128, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=128, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={3:0}, t1={7:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 128 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 444 IncrementalHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 20 mSDtfsCounter, 444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 335 SizeOfPredicates, 11 NumberOfNonLiveVariables, 566 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 21:11:23,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfb852e6-d31c-4bbb-99f2-9e5f102fec6f/bin/uautomizer-TMbwUNV5ro/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 Result: UNKNOWN: Overapproximated counterexample