./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a --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 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --- 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-b5237d8 [2022-11-21 09:04:10,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:04:10,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:04:10,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:04:10,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:04:10,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:04:10,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:04:10,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:04:10,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:04:10,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:04:10,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:04:10,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:04:10,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:04:10,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:04:10,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:04:10,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:04:10,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:04:10,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:04:10,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:04:10,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:04:10,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:04:10,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:04:10,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:04:10,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:04:10,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:04:10,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:04:10,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:04:10,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:04:10,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:04:10,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:04:10,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:04:10,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:04:10,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:04:10,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:04:10,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:04:10,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:04:10,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:04:10,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:04:10,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:04:10,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:04:10,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:04:10,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 09:04:10,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:04:10,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:04:10,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:04:10,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:04:10,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:04:10,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:04:10,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:04:10,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:04:10,302 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:04:10,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:04:10,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:04:10,304 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 09:04:10,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 09:04:10,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:04:10,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:04:10,305 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 09:04:10,305 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 09:04:10,306 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 09:04:10,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:04:10,306 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 09:04:10,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:04:10,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:04:10,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:04:10,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:04:10,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:04:10,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:04:10,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:04:10,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:04:10,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 09:04:10,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 09:04:10,310 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_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 [2022-11-21 09:04:10,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:04:10,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:04:10,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:04:10,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:04:10,692 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:04:10,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2022-11-21 09:04:13,982 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:04:14,403 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:04:14,403 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2022-11-21 09:04:14,424 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/data/491091116/3b7c08e58c2c49a18da6496281542469/FLAG70c46d0da [2022-11-21 09:04:14,445 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/data/491091116/3b7c08e58c2c49a18da6496281542469 [2022-11-21 09:04:14,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:04:14,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:04:14,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:04:14,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:04:14,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:04:14,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:04:14" (1/1) ... [2022-11-21 09:04:14,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b196b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:14, skipping insertion in model container [2022-11-21 09:04:14,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:04:14" (1/1) ... [2022-11-21 09:04:14,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:04:14,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:04:14,722 WARN L237 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_8d147939-02fb-4479-93c0-22dc8c9b8a45/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i[949,962] [2022-11-21 09:04:15,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:04:15,153 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:04:15,170 WARN L237 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_8d147939-02fb-4479-93c0-22dc8c9b8a45/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i[949,962] [2022-11-21 09:04:15,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:04:15,269 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:04:15,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15 WrapperNode [2022-11-21 09:04:15,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:04:15,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:04:15,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:04:15,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:04:15,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,395 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-11-21 09:04:15,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:04:15,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:04:15,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:04:15,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:04:15,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,444 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:04:15,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:04:15,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:04:15,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:04:15,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (1/1) ... [2022-11-21 09:04:15,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:04:15,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:04:15,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:04:15,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:04:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 09:04:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 09:04:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:04:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 09:04:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 09:04:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 09:04:15,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 09:04:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 09:04:15,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 09:04:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 09:04:15,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 09:04:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-21 09:04:15,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-21 09:04:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 09:04:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 09:04:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:04:15,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:04:15,583 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 09:04:15,864 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:04:15,866 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:04:16,433 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:04:16,649 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:04:16,649 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 09:04:16,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:04:16 BoogieIcfgContainer [2022-11-21 09:04:16,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:04:16,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:04:16,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:04:16,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:04:16,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:04:14" (1/3) ... [2022-11-21 09:04:16,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3a0b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:04:16, skipping insertion in model container [2022-11-21 09:04:16,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:15" (2/3) ... [2022-11-21 09:04:16,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3a0b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:04:16, skipping insertion in model container [2022-11-21 09:04:16,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:04:16" (3/3) ... [2022-11-21 09:04:16,664 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-11-21 09:04:16,688 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:04:16,688 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-21 09:04:16,689 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 09:04:16,769 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 09:04:16,809 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 09:04:16,837 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-21 09:04:16,849 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-21 09:04:16,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-11-21 09:04:16,932 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-21 09:04:16,932 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 09:04:16,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-21 09:04:16,948 INFO L119 LiptonReduction]: Number of co-enabled transitions 3552 [2022-11-21 09:04:25,788 INFO L134 LiptonReduction]: Checked pairs total: 10130 [2022-11-21 09:04:25,789 INFO L136 LiptonReduction]: Total number of compositions: 141 [2022-11-21 09:04:25,798 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-21 09:04:26,114 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 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-21 09:04:26,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:04:26,143 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;@76c5df48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:04:26,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-21 09:04:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 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-21 09:04:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 09:04:26,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:26,175 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 09:04:26,176 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:26,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 611, now seen corresponding path program 1 times [2022-11-21 09:04:26,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:26,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581168652] [2022-11-21 09:04:26,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:26,366 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-21 09:04:26,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:26,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581168652] [2022-11-21 09:04:26,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581168652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:26,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:26,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 09:04:26,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128184729] [2022-11-21 09:04:26,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:26,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 09:04:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:26,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 09:04:26,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 09:04:26,455 INFO L87 Difference]: Start difference. First operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 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-21 09:04:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:26,742 INFO L93 Difference]: Finished difference Result 4850 states and 19358 transitions. [2022-11-21 09:04:26,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 09:04:26,746 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-21 09:04:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:26,829 INFO L225 Difference]: With dead ends: 4850 [2022-11-21 09:04:26,829 INFO L226 Difference]: Without dead ends: 4850 [2022-11-21 09:04:26,830 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-21 09:04:26,837 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:26,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:04:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2022-11-21 09:04:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4850. [2022-11-21 09:04:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4850 states, 4845 states have (on average 3.995459236326109) internal successors, (19358), 4849 states have internal predecessors, (19358), 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-21 09:04:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 19358 transitions. [2022-11-21 09:04:27,248 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 19358 transitions. Word has length 1 [2022-11-21 09:04:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:27,250 INFO L495 AbstractCegarLoop]: Abstraction has 4850 states and 19358 transitions. [2022-11-21 09:04:27,255 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-21 09:04:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 19358 transitions. [2022-11-21 09:04:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 09:04:27,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:27,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:27,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 09:04:27,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1303940140, now seen corresponding path program 1 times [2022-11-21 09:04:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:27,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359750651] [2022-11-21 09:04:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:27,927 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-21 09:04:27,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:27,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359750651] [2022-11-21 09:04:27,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359750651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:27,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:27,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 09:04:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168846050] [2022-11-21 09:04:27,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:27,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:04:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:04:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:04:27,932 INFO L87 Difference]: Start difference. First operand 4850 states and 19358 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-21 09:04:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:28,114 INFO L93 Difference]: Finished difference Result 3970 states and 15654 transitions. [2022-11-21 09:04:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:04:28,115 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-21 09:04:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:28,153 INFO L225 Difference]: With dead ends: 3970 [2022-11-21 09:04:28,153 INFO L226 Difference]: Without dead ends: 3850 [2022-11-21 09:04:28,154 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-21 09:04:28,155 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:28,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 10 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:04:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2022-11-21 09:04:28,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3850. [2022-11-21 09:04:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3848 states have (on average 3.9625779625779627) internal successors, (15248), 3849 states have internal predecessors, (15248), 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-21 09:04:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 15248 transitions. [2022-11-21 09:04:28,420 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 15248 transitions. Word has length 7 [2022-11-21 09:04:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:28,421 INFO L495 AbstractCegarLoop]: Abstraction has 3850 states and 15248 transitions. [2022-11-21 09:04:28,422 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-21 09:04:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 15248 transitions. [2022-11-21 09:04:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 09:04:28,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:28,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:28,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 09:04:28,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1652670574, now seen corresponding path program 1 times [2022-11-21 09:04:28,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:28,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872767284] [2022-11-21 09:04:28,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:28,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:29,279 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-21 09:04:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:29,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872767284] [2022-11-21 09:04:29,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872767284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:29,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:29,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:04:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307673454] [2022-11-21 09:04:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:29,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:04:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:29,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:04:29,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:04:29,282 INFO L87 Difference]: Start difference. First operand 3850 states and 15248 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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-21 09:04:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:29,695 INFO L93 Difference]: Finished difference Result 6106 states and 23390 transitions. [2022-11-21 09:04:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:04:29,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-21 09:04:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:29,775 INFO L225 Difference]: With dead ends: 6106 [2022-11-21 09:04:29,776 INFO L226 Difference]: Without dead ends: 6106 [2022-11-21 09:04:29,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:04:29,780 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:29,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 7 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 09:04:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6106 states. [2022-11-21 09:04:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6106 to 4090. [2022-11-21 09:04:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4090 states, 4088 states have (on average 3.950587084148728) internal successors, (16150), 4089 states have internal predecessors, (16150), 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-21 09:04:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4090 states to 4090 states and 16150 transitions. [2022-11-21 09:04:30,059 INFO L78 Accepts]: Start accepts. Automaton has 4090 states and 16150 transitions. Word has length 11 [2022-11-21 09:04:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:30,059 INFO L495 AbstractCegarLoop]: Abstraction has 4090 states and 16150 transitions. [2022-11-21 09:04:30,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-21 09:04:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4090 states and 16150 transitions. [2022-11-21 09:04:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 09:04:30,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:30,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:30,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 09:04:30,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:30,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:30,073 INFO L85 PathProgramCache]: Analyzing trace with hash 306820720, now seen corresponding path program 1 times [2022-11-21 09:04:30,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:30,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538849543] [2022-11-21 09:04:30,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:30,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:31,064 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-21 09:04:31,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:31,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538849543] [2022-11-21 09:04:31,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538849543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:31,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:31,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 09:04:31,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681853555] [2022-11-21 09:04:31,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:31,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:04:31,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:31,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:04:31,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:04:31,068 INFO L87 Difference]: Start difference. First operand 4090 states and 16150 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-21 09:04:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:31,575 INFO L93 Difference]: Finished difference Result 4110 states and 15746 transitions. [2022-11-21 09:04:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:04:31,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-21 09:04:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:31,600 INFO L225 Difference]: With dead ends: 4110 [2022-11-21 09:04:31,600 INFO L226 Difference]: Without dead ends: 3510 [2022-11-21 09:04:31,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:04:31,605 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:31,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 74 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 09:04:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2022-11-21 09:04:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 3410. [2022-11-21 09:04:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 3408 states have (on average 3.880868544600939) internal successors, (13226), 3409 states have internal predecessors, (13226), 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-21 09:04:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 13226 transitions. [2022-11-21 09:04:31,798 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 13226 transitions. Word has length 12 [2022-11-21 09:04:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:31,800 INFO L495 AbstractCegarLoop]: Abstraction has 3410 states and 13226 transitions. [2022-11-21 09:04:31,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-21 09:04:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 13226 transitions. [2022-11-21 09:04:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 09:04:31,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:31,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:31,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 09:04:31,806 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash 899477997, now seen corresponding path program 1 times [2022-11-21 09:04:31,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:31,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14048408] [2022-11-21 09:04:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:31,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:32,848 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-21 09:04:32,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:32,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14048408] [2022-11-21 09:04:32,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14048408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:32,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:32,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 09:04:32,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523733432] [2022-11-21 09:04:32,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:32,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:04:32,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:32,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:04:32,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:04:32,859 INFO L87 Difference]: Start difference. First operand 3410 states and 13226 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-21 09:04:33,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:33,245 INFO L93 Difference]: Finished difference Result 3010 states and 11586 transitions. [2022-11-21 09:04:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:04:33,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-21 09:04:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:33,266 INFO L225 Difference]: With dead ends: 3010 [2022-11-21 09:04:33,267 INFO L226 Difference]: Without dead ends: 2594 [2022-11-21 09:04:33,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:04:33,268 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:33,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 75 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 09:04:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2022-11-21 09:04:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2594. [2022-11-21 09:04:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2593 states have (on average 3.74315464712688) internal successors, (9706), 2593 states have internal predecessors, (9706), 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-21 09:04:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 9706 transitions. [2022-11-21 09:04:33,371 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 9706 transitions. Word has length 14 [2022-11-21 09:04:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:33,372 INFO L495 AbstractCegarLoop]: Abstraction has 2594 states and 9706 transitions. [2022-11-21 09:04:33,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-21 09:04:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 9706 transitions. [2022-11-21 09:04:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 09:04:33,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:33,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:33,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 09:04:33,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash 899474964, now seen corresponding path program 1 times [2022-11-21 09:04:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:33,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638172054] [2022-11-21 09:04:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:33,944 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-21 09:04:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:33,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638172054] [2022-11-21 09:04:33,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638172054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:33,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:33,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:04:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866038548] [2022-11-21 09:04:33,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:33,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:04:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:33,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:04:33,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:04:33,947 INFO L87 Difference]: Start difference. First operand 2594 states and 9706 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-21 09:04:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:34,079 INFO L93 Difference]: Finished difference Result 2570 states and 9600 transitions. [2022-11-21 09:04:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:04:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-21 09:04:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:34,096 INFO L225 Difference]: With dead ends: 2570 [2022-11-21 09:04:34,097 INFO L226 Difference]: Without dead ends: 2570 [2022-11-21 09:04:34,097 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-21 09:04:34,098 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:34,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 13 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:04:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-11-21 09:04:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2562. [2022-11-21 09:04:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2561 states have (on average 3.7383834439672) internal successors, (9574), 2561 states have internal predecessors, (9574), 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-21 09:04:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 9574 transitions. [2022-11-21 09:04:34,195 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 9574 transitions. Word has length 14 [2022-11-21 09:04:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:34,196 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 9574 transitions. [2022-11-21 09:04:34,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-21 09:04:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 9574 transitions. [2022-11-21 09:04:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 09:04:34,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:34,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:34,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 09:04:34,201 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:34,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash -273955368, now seen corresponding path program 1 times [2022-11-21 09:04:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:34,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836523209] [2022-11-21 09:04:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:34,980 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-21 09:04:34,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:34,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836523209] [2022-11-21 09:04:34,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836523209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:34,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:34,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:04:34,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622514413] [2022-11-21 09:04:34,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:34,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:04:34,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:34,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:04:34,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:04:34,984 INFO L87 Difference]: Start difference. First operand 2562 states and 9574 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:35,197 INFO L93 Difference]: Finished difference Result 2642 states and 9870 transitions. [2022-11-21 09:04:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:04:35,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 09:04:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:35,217 INFO L225 Difference]: With dead ends: 2642 [2022-11-21 09:04:35,217 INFO L226 Difference]: Without dead ends: 2642 [2022-11-21 09:04:35,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:04:35,220 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:35,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 22 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:04:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2022-11-21 09:04:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2632. [2022-11-21 09:04:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2631 states have (on average 3.7381223869251237) internal successors, (9835), 2631 states have internal predecessors, (9835), 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-21 09:04:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 9835 transitions. [2022-11-21 09:04:35,359 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 9835 transitions. Word has length 15 [2022-11-21 09:04:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:35,359 INFO L495 AbstractCegarLoop]: Abstraction has 2632 states and 9835 transitions. [2022-11-21 09:04:35,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 9835 transitions. [2022-11-21 09:04:35,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 09:04:35,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:35,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:35,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 09:04:35,366 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2113894012, now seen corresponding path program 2 times [2022-11-21 09:04:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:35,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26817726] [2022-11-21 09:04:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:36,217 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-21 09:04:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:36,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26817726] [2022-11-21 09:04:36,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26817726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:36,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:36,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:04:36,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638359227] [2022-11-21 09:04:36,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:36,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:04:36,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:36,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:04:36,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:04:36,224 INFO L87 Difference]: Start difference. First operand 2632 states and 9835 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:36,411 INFO L93 Difference]: Finished difference Result 2720 states and 10147 transitions. [2022-11-21 09:04:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:04:36,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 09:04:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:36,429 INFO L225 Difference]: With dead ends: 2720 [2022-11-21 09:04:36,429 INFO L226 Difference]: Without dead ends: 2720 [2022-11-21 09:04:36,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:04:36,432 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:36,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 14 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:04:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2022-11-21 09:04:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2630. [2022-11-21 09:04:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 2629 states have (on average 3.7360213008748575) internal successors, (9822), 2629 states have internal predecessors, (9822), 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-21 09:04:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 9822 transitions. [2022-11-21 09:04:36,533 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 9822 transitions. Word has length 15 [2022-11-21 09:04:36,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:36,533 INFO L495 AbstractCegarLoop]: Abstraction has 2630 states and 9822 transitions. [2022-11-21 09:04:36,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 9822 transitions. [2022-11-21 09:04:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 09:04:36,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:36,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:36,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 09:04:36,539 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2113916022, now seen corresponding path program 1 times [2022-11-21 09:04:36,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:36,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509960977] [2022-11-21 09:04:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:36,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:36,938 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-21 09:04:36,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:36,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509960977] [2022-11-21 09:04:36,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509960977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:36,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:36,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:04:36,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435240869] [2022-11-21 09:04:36,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:36,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:04:36,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:36,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:04:36,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:04:36,960 INFO L87 Difference]: Start difference. First operand 2630 states and 9822 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:37,207 INFO L93 Difference]: Finished difference Result 2678 states and 10002 transitions. [2022-11-21 09:04:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:04:37,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 09:04:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:37,223 INFO L225 Difference]: With dead ends: 2678 [2022-11-21 09:04:37,224 INFO L226 Difference]: Without dead ends: 2678 [2022-11-21 09:04:37,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:04:37,225 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:37,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:04:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2022-11-21 09:04:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2640. [2022-11-21 09:04:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 3.7374005305039786) internal successors, (9863), 2639 states have internal predecessors, (9863), 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-21 09:04:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 9863 transitions. [2022-11-21 09:04:37,340 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 9863 transitions. Word has length 15 [2022-11-21 09:04:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:37,341 INFO L495 AbstractCegarLoop]: Abstraction has 2640 states and 9863 transitions. [2022-11-21 09:04:37,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 9863 transitions. [2022-11-21 09:04:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 09:04:37,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:37,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:37,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 09:04:37,350 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2111415252, now seen corresponding path program 2 times [2022-11-21 09:04:37,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:37,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196992935] [2022-11-21 09:04:37,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:38,064 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-21 09:04:38,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:38,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196992935] [2022-11-21 09:04:38,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196992935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:38,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:38,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:04:38,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812788068] [2022-11-21 09:04:38,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:38,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:04:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:38,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:04:38,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:04:38,066 INFO L87 Difference]: Start difference. First operand 2640 states and 9863 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:38,439 INFO L93 Difference]: Finished difference Result 3674 states and 13546 transitions. [2022-11-21 09:04:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 09:04:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 09:04:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:38,458 INFO L225 Difference]: With dead ends: 3674 [2022-11-21 09:04:38,459 INFO L226 Difference]: Without dead ends: 3674 [2022-11-21 09:04:38,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:04:38,459 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:38,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 24 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 09:04:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2022-11-21 09:04:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2722. [2022-11-21 09:04:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2721 states have (on average 3.74090407938258) internal successors, (10179), 2721 states have internal predecessors, (10179), 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-21 09:04:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 10179 transitions. [2022-11-21 09:04:38,569 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 10179 transitions. Word has length 15 [2022-11-21 09:04:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:38,569 INFO L495 AbstractCegarLoop]: Abstraction has 2722 states and 10179 transitions. [2022-11-21 09:04:38,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 10179 transitions. [2022-11-21 09:04:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 09:04:38,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:38,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:38,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 09:04:38,574 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1434851036, now seen corresponding path program 3 times [2022-11-21 09:04:38,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:38,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892344354] [2022-11-21 09:04:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:39,029 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-21 09:04:39,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:39,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892344354] [2022-11-21 09:04:39,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892344354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:39,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:39,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:04:39,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232816668] [2022-11-21 09:04:39,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:39,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:04:39,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:39,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:04:39,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:04:39,033 INFO L87 Difference]: Start difference. First operand 2722 states and 10179 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:39,243 INFO L93 Difference]: Finished difference Result 2750 states and 10276 transitions. [2022-11-21 09:04:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:04:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 09:04:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:39,258 INFO L225 Difference]: With dead ends: 2750 [2022-11-21 09:04:39,258 INFO L226 Difference]: Without dead ends: 2750 [2022-11-21 09:04:39,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:04:39,259 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:39,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 23 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:04:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2022-11-21 09:04:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2714. [2022-11-21 09:04:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2713 states have (on average 3.737928492443789) internal successors, (10141), 2713 states have internal predecessors, (10141), 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-21 09:04:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 10141 transitions. [2022-11-21 09:04:39,345 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 10141 transitions. Word has length 15 [2022-11-21 09:04:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:39,347 INFO L495 AbstractCegarLoop]: Abstraction has 2714 states and 10141 transitions. [2022-11-21 09:04:39,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-21 09:04:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 10141 transitions. [2022-11-21 09:04:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 09:04:39,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:39,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:39,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 09:04:39,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash 97314098, now seen corresponding path program 1 times [2022-11-21 09:04:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:39,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543251549] [2022-11-21 09:04:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:39,751 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-21 09:04:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:39,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543251549] [2022-11-21 09:04:39,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543251549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:39,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:39,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 09:04:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794435080] [2022-11-21 09:04:39,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:39,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 09:04:39,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:39,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 09:04:39,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:04:39,754 INFO L87 Difference]: Start difference. First operand 2714 states and 10141 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-21 09:04:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:39,969 INFO L93 Difference]: Finished difference Result 3062 states and 11394 transitions. [2022-11-21 09:04:39,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 09:04:39,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 09:04:39,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:39,986 INFO L225 Difference]: With dead ends: 3062 [2022-11-21 09:04:39,986 INFO L226 Difference]: Without dead ends: 3062 [2022-11-21 09:04:39,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-21 09:04:39,988 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 79 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:39,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 22 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:04:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2022-11-21 09:04:40,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2788. [2022-11-21 09:04:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2788 states, 2787 states have (on average 3.7312522425547185) internal successors, (10399), 2787 states have internal predecessors, (10399), 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-21 09:04:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 10399 transitions. [2022-11-21 09:04:40,150 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 10399 transitions. Word has length 16 [2022-11-21 09:04:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:40,151 INFO L495 AbstractCegarLoop]: Abstraction has 2788 states and 10399 transitions. [2022-11-21 09:04:40,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-21 09:04:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 10399 transitions. [2022-11-21 09:04:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 09:04:40,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:40,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:40,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 09:04:40,159 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash 94813328, now seen corresponding path program 2 times [2022-11-21 09:04:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:40,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854732540] [2022-11-21 09:04:40,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:41,223 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-21 09:04:41,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:41,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854732540] [2022-11-21 09:04:41,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854732540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:41,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:41,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 09:04:41,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402506698] [2022-11-21 09:04:41,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:41,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 09:04:41,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:41,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 09:04:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:04:41,227 INFO L87 Difference]: Start difference. First operand 2788 states and 10399 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-21 09:04:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:41,540 INFO L93 Difference]: Finished difference Result 3448 states and 12747 transitions. [2022-11-21 09:04:41,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:04:41,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 09:04:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:41,559 INFO L225 Difference]: With dead ends: 3448 [2022-11-21 09:04:41,559 INFO L226 Difference]: Without dead ends: 3448 [2022-11-21 09:04:41,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-21 09:04:41,561 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 106 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:41,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 26 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:04:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2022-11-21 09:04:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3010. [2022-11-21 09:04:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 3009 states have (on average 3.7414423396477234) internal successors, (11258), 3009 states have internal predecessors, (11258), 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-21 09:04:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 11258 transitions. [2022-11-21 09:04:41,667 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 11258 transitions. Word has length 16 [2022-11-21 09:04:41,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:41,668 INFO L495 AbstractCegarLoop]: Abstraction has 3010 states and 11258 transitions. [2022-11-21 09:04:41,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-21 09:04:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 11258 transitions. [2022-11-21 09:04:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 09:04:41,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:41,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:41,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 09:04:41,675 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1809270873, now seen corresponding path program 1 times [2022-11-21 09:04:41,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:41,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103597860] [2022-11-21 09:04:41,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:41,963 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-21 09:04:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:41,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103597860] [2022-11-21 09:04:41,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103597860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:41,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:41,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:04:41,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59359613] [2022-11-21 09:04:41,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:41,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:04:41,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:41,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:04:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:04:41,966 INFO L87 Difference]: Start difference. First operand 3010 states and 11258 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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-21 09:04:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:42,131 INFO L93 Difference]: Finished difference Result 3100 states and 10613 transitions. [2022-11-21 09:04:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:04:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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-21 09:04:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:42,144 INFO L225 Difference]: With dead ends: 3100 [2022-11-21 09:04:42,145 INFO L226 Difference]: Without dead ends: 2308 [2022-11-21 09:04:42,145 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-21 09:04:42,146 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:42,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 25 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:04:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2022-11-21 09:04:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2308. [2022-11-21 09:04:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2307 states have (on average 3.3810143042912872) internal successors, (7800), 2307 states have internal predecessors, (7800), 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-21 09:04:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 7800 transitions. [2022-11-21 09:04:42,223 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 7800 transitions. Word has length 17 [2022-11-21 09:04:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:42,223 INFO L495 AbstractCegarLoop]: Abstraction has 2308 states and 7800 transitions. [2022-11-21 09:04:42,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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-21 09:04:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 7800 transitions. [2022-11-21 09:04:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 09:04:42,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:42,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:42,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 09:04:42,229 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1400684178, now seen corresponding path program 1 times [2022-11-21 09:04:42,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:42,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337498999] [2022-11-21 09:04:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:42,612 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-21 09:04:42,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:42,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337498999] [2022-11-21 09:04:42,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337498999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:42,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:42,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 09:04:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3459288] [2022-11-21 09:04:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:42,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:04:42,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:42,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:04:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:04:42,614 INFO L87 Difference]: Start difference. First operand 2308 states and 7800 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-21 09:04:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:42,829 INFO L93 Difference]: Finished difference Result 1960 states and 6160 transitions. [2022-11-21 09:04:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 09:04:42,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2022-11-21 09:04:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:42,837 INFO L225 Difference]: With dead ends: 1960 [2022-11-21 09:04:42,837 INFO L226 Difference]: Without dead ends: 1471 [2022-11-21 09:04:42,837 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-21 09:04:42,838 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:42,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 35 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:04:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2022-11-21 09:04:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471. [2022-11-21 09:04:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1470 states have (on average 3.0755102040816324) internal successors, (4521), 1470 states have internal predecessors, (4521), 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-21 09:04:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 4521 transitions. [2022-11-21 09:04:42,880 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 4521 transitions. Word has length 18 [2022-11-21 09:04:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:42,881 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 4521 transitions. [2022-11-21 09:04:42,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-21 09:04:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 4521 transitions. [2022-11-21 09:04:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 09:04:42,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:42,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:42,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 09:04:42,885 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:42,886 INFO L85 PathProgramCache]: Analyzing trace with hash 561037650, now seen corresponding path program 1 times [2022-11-21 09:04:42,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:42,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826782806] [2022-11-21 09:04:42,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:42,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:43,068 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-21 09:04:43,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:43,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826782806] [2022-11-21 09:04:43,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826782806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:43,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:43,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:04:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348491435] [2022-11-21 09:04:43,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:43,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:04:43,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:04:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:04:43,074 INFO L87 Difference]: Start difference. First operand 1471 states and 4521 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-21 09:04:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:43,190 INFO L93 Difference]: Finished difference Result 2133 states and 6392 transitions. [2022-11-21 09:04:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:04:43,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-11-21 09:04:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:43,197 INFO L225 Difference]: With dead ends: 2133 [2022-11-21 09:04:43,197 INFO L226 Difference]: Without dead ends: 1475 [2022-11-21 09:04:43,198 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-21 09:04:43,199 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:43,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 13 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:04:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2022-11-21 09:04:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1365. [2022-11-21 09:04:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 2.908357771260997) internal successors, (3967), 1364 states have internal predecessors, (3967), 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-21 09:04:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3967 transitions. [2022-11-21 09:04:43,239 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3967 transitions. Word has length 20 [2022-11-21 09:04:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:43,240 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 3967 transitions. [2022-11-21 09:04:43,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-21 09:04:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3967 transitions. [2022-11-21 09:04:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 09:04:43,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:43,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:43,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 09:04:43,245 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 212295895, now seen corresponding path program 1 times [2022-11-21 09:04:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:43,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749649528] [2022-11-21 09:04:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:43,519 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-21 09:04:43,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:43,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749649528] [2022-11-21 09:04:43,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749649528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:43,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:43,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 09:04:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579888249] [2022-11-21 09:04:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:43,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 09:04:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 09:04:43,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:04:43,522 INFO L87 Difference]: Start difference. First operand 1365 states and 3967 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-21 09:04:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:43,751 INFO L93 Difference]: Finished difference Result 1203 states and 3454 transitions. [2022-11-21 09:04:43,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:04:43,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2022-11-21 09:04:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:43,756 INFO L225 Difference]: With dead ends: 1203 [2022-11-21 09:04:43,756 INFO L226 Difference]: Without dead ends: 1055 [2022-11-21 09:04:43,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:04:43,757 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 90 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:43,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 39 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:04:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-11-21 09:04:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 927. [2022-11-21 09:04:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 926 states have (on average 2.9060475161987043) internal successors, (2691), 926 states have internal predecessors, (2691), 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-21 09:04:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2691 transitions. [2022-11-21 09:04:43,784 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2691 transitions. Word has length 21 [2022-11-21 09:04:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:43,784 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 2691 transitions. [2022-11-21 09:04:43,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-21 09:04:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2691 transitions. [2022-11-21 09:04:43,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 09:04:43,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:43,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:43,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 09:04:43,789 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:43,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2009117359, now seen corresponding path program 1 times [2022-11-21 09:04:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:43,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719748334] [2022-11-21 09:04:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:44,329 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-21 09:04:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:44,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719748334] [2022-11-21 09:04:44,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719748334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:44,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:44,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 09:04:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286621503] [2022-11-21 09:04:44,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:44,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:04:44,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:44,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:04:44,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:04:44,331 INFO L87 Difference]: Start difference. First operand 927 states and 2691 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-21 09:04:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:44,781 INFO L93 Difference]: Finished difference Result 1284 states and 3636 transitions. [2022-11-21 09:04:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 09:04:44,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2022-11-21 09:04:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:44,785 INFO L225 Difference]: With dead ends: 1284 [2022-11-21 09:04:44,785 INFO L226 Difference]: Without dead ends: 895 [2022-11-21 09:04:44,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:04:44,790 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 59 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:44,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 23 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 09:04:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-21 09:04:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 819. [2022-11-21 09:04:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 2.726161369193154) internal successors, (2230), 818 states have internal predecessors, (2230), 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-21 09:04:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2230 transitions. [2022-11-21 09:04:44,819 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2230 transitions. Word has length 24 [2022-11-21 09:04:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:44,820 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 2230 transitions. [2022-11-21 09:04:44,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-21 09:04:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2230 transitions. [2022-11-21 09:04:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 09:04:44,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:44,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:44,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 09:04:44,823 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:44,824 INFO L85 PathProgramCache]: Analyzing trace with hash 948424523, now seen corresponding path program 1 times [2022-11-21 09:04:44,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:44,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045843648] [2022-11-21 09:04:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:45,602 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-21 09:04:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:45,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045843648] [2022-11-21 09:04:45,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045843648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:45,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:45,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 09:04:45,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995166572] [2022-11-21 09:04:45,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:45,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:04:45,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:45,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:04:45,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:04:45,605 INFO L87 Difference]: Start difference. First operand 819 states and 2230 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-21 09:04:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:45,883 INFO L93 Difference]: Finished difference Result 1107 states and 2940 transitions. [2022-11-21 09:04:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:04:45,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-11-21 09:04:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:45,888 INFO L225 Difference]: With dead ends: 1107 [2022-11-21 09:04:45,888 INFO L226 Difference]: Without dead ends: 918 [2022-11-21 09:04:45,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:04:45,889 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 115 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:45,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 24 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:04:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-11-21 09:04:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 773. [2022-11-21 09:04:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 2.655440414507772) internal successors, (2050), 772 states have internal predecessors, (2050), 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-21 09:04:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 2050 transitions. [2022-11-21 09:04:45,910 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 2050 transitions. Word has length 24 [2022-11-21 09:04:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:45,910 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 2050 transitions. [2022-11-21 09:04:45,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-21 09:04:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 2050 transitions. [2022-11-21 09:04:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 09:04:45,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:45,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:45,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 09:04:45,914 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1663701567, now seen corresponding path program 2 times [2022-11-21 09:04:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:45,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401953645] [2022-11-21 09:04:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:46,172 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-21 09:04:46,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:46,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401953645] [2022-11-21 09:04:46,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401953645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:46,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:46,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:04:46,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202108761] [2022-11-21 09:04:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:46,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:04:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:46,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:04:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:04:46,175 INFO L87 Difference]: Start difference. First operand 773 states and 2050 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-21 09:04:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:46,367 INFO L93 Difference]: Finished difference Result 743 states and 1991 transitions. [2022-11-21 09:04:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 09:04:46,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-11-21 09:04:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:46,369 INFO L225 Difference]: With dead ends: 743 [2022-11-21 09:04:46,369 INFO L226 Difference]: Without dead ends: 226 [2022-11-21 09:04:46,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 09:04:46,370 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:46,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 26 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:04:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-21 09:04:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 190. [2022-11-21 09:04:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.4497354497354498) internal successors, (463), 189 states have internal predecessors, (463), 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-21 09:04:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 463 transitions. [2022-11-21 09:04:46,375 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 463 transitions. Word has length 24 [2022-11-21 09:04:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:46,376 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 463 transitions. [2022-11-21 09:04:46,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-21 09:04:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 463 transitions. [2022-11-21 09:04:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 09:04:46,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:46,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:46,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 09:04:46,377 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash 380741021, now seen corresponding path program 1 times [2022-11-21 09:04:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:46,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570900919] [2022-11-21 09:04:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:04:48,004 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-21 09:04:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:04:48,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570900919] [2022-11-21 09:04:48,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570900919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:04:48,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:04:48,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:04:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880619919] [2022-11-21 09:04:48,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:04:48,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 09:04:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:04:48,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 09:04:48,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 09:04:48,009 INFO L87 Difference]: Start difference. First operand 190 states and 463 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-21 09:04:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:04:48,217 INFO L93 Difference]: Finished difference Result 228 states and 549 transitions. [2022-11-21 09:04:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:04:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 27 [2022-11-21 09:04:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:04:48,219 INFO L225 Difference]: With dead ends: 228 [2022-11-21 09:04:48,219 INFO L226 Difference]: Without dead ends: 168 [2022-11-21 09:04:48,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-21 09:04:48,220 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 91 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:04:48,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 24 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:04:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-21 09:04:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-11-21 09:04:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.4850299401197606) internal successors, (415), 167 states have internal predecessors, (415), 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-21 09:04:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2022-11-21 09:04:48,224 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2022-11-21 09:04:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:04:48,226 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2022-11-21 09:04:48,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-21 09:04:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2022-11-21 09:04:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 09:04:48,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:04:48,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:48,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 09:04:48,228 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:04:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:04:48,229 INFO L85 PathProgramCache]: Analyzing trace with hash -205357731, now seen corresponding path program 2 times [2022-11-21 09:04:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:04:48,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558706907] [2022-11-21 09:04:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:04:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:04:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 09:04:48,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 09:04:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 09:04:48,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 09:04:48,444 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 09:04:48,445 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-21 09:04:48,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-21 09:04:48,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-21 09:04:48,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-21 09:04:48,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-21 09:04:48,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-21 09:04:48,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-21 09:04:48,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-21 09:04:48,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-21 09:04:48,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-21 09:04:48,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-21 09:04:48,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-21 09:04:48,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-21 09:04:48,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-21 09:04:48,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-21 09:04:48,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-21 09:04:48,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 09:04:48,456 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:04:48,463 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 09:04:48,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 09:04:48,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:04:48 BasicIcfg [2022-11-21 09:04:48,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 09:04:48,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 09:04:48,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 09:04:48,588 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 09:04:48,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:04:16" (3/4) ... [2022-11-21 09:04:48,592 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 09:04:48,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 09:04:48,593 INFO L158 Benchmark]: Toolchain (without parser) took 34142.55ms. Allocated memory was 148.9MB in the beginning and 763.4MB in the end (delta: 614.5MB). Free memory was 103.8MB in the beginning and 223.2MB in the end (delta: -119.5MB). Peak memory consumption was 497.6MB. Max. memory is 16.1GB. [2022-11-21 09:04:48,593 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 148.9MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:04:48,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 819.79ms. Allocated memory is still 148.9MB. Free memory was 103.8MB in the beginning and 80.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 09:04:48,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.17ms. Allocated memory is still 148.9MB. Free memory was 80.2MB in the beginning and 77.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 09:04:48,594 INFO L158 Benchmark]: Boogie Preprocessor took 51.24ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 75.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 09:04:48,594 INFO L158 Benchmark]: RCFGBuilder took 1202.39ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 75.2MB in the beginning and 127.9MB in the end (delta: -52.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2022-11-21 09:04:48,595 INFO L158 Benchmark]: TraceAbstraction took 31931.13ms. Allocated memory was 180.4MB in the beginning and 763.4MB in the end (delta: 583.0MB). Free memory was 127.2MB in the beginning and 223.2MB in the end (delta: -96.1MB). Peak memory consumption was 486.6MB. Max. memory is 16.1GB. [2022-11-21 09:04:48,595 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 763.4MB. Free memory is still 223.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:04:48,597 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.35ms. Allocated memory is still 148.9MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 819.79ms. Allocated memory is still 148.9MB. Free memory was 103.8MB in the beginning and 80.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.17ms. Allocated memory is still 148.9MB. Free memory was 80.2MB in the beginning and 77.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.24ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 75.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1202.39ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 75.2MB in the beginning and 127.9MB in the end (delta: -52.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 31931.13ms. Allocated memory was 180.4MB in the beginning and 763.4MB in the end (delta: 583.0MB). Free memory was 127.2MB in the beginning and 223.2MB in the end (delta: -96.1MB). Peak memory consumption was 486.6MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 763.4MB. Free memory is still 223.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: 8.9s, 159 PlacesBefore, 56 PlacesAfterwards, 148 TransitionsBefore, 44 TransitionsAfterwards, 3552 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 10130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5289, independent: 5060, independent conditional: 0, independent unconditional: 5060, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2648, independent: 2557, independent conditional: 0, independent unconditional: 2557, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2648, independent: 2518, independent conditional: 0, independent unconditional: 2518, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 130, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 922, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 829, dependent conditional: 0, dependent unconditional: 829, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5289, independent: 2503, independent conditional: 0, independent unconditional: 2503, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 2648, unknown conditional: 0, unknown unconditional: 2648] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 348, Positive conditional cache size: 0, Positive unconditional cache size: 348, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=-3, t577={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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=-2, t577={5:0}, t578={6: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=-1, t577={5:0}, t578={6:0}, t579={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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t580; [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 851]: 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: 853]: 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 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 31.6s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1142 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1142 mSDsluCounter, 546 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2271 IncrementalHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 186 mSDtfsCounter, 2271 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5140occurred in iteration=0, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 4457 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 4094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-21 09:04:48,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a --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 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --- 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-b5237d8 [2022-11-21 09:04:51,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:04:51,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:04:51,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:04:51,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:04:51,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:04:51,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:04:51,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:04:51,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:04:51,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:04:51,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:04:51,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:04:51,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:04:51,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:04:51,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:04:51,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:04:51,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:04:51,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:04:51,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:04:51,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:04:51,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:04:51,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:04:51,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:04:51,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:04:51,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:04:51,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:04:51,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:04:51,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:04:51,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:04:51,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:04:51,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:04:51,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:04:51,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:04:51,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:04:51,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:04:51,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:04:51,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:04:51,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:04:51,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:04:51,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:04:51,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:04:51,556 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 09:04:51,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:04:51,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:04:51,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:04:51,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:04:51,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:04:51,604 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:04:51,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:04:51,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:04:51,606 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:04:51,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:04:51,607 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:04:51,608 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 09:04:51,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 09:04:51,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:04:51,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:04:51,609 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 09:04:51,609 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 09:04:51,609 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 09:04:51,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:04:51,610 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 09:04:51,610 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 09:04:51,610 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 09:04:51,610 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:04:51,611 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:04:51,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:04:51,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:04:51,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:04:51,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:04:51,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:04:51,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:04:51,613 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 09:04:51,613 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 09:04:51,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 09:04:51,614 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_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 [2022-11-21 09:04:52,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:04:52,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:04:52,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:04:52,103 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:04:52,104 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:04:52,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2022-11-21 09:04:55,678 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:04:55,969 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:04:55,970 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2022-11-21 09:04:55,997 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/data/b870f4b01/eb3868879f5446a082c8eee13e058297/FLAGad5dccaa1 [2022-11-21 09:04:56,012 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/data/b870f4b01/eb3868879f5446a082c8eee13e058297 [2022-11-21 09:04:56,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:04:56,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:04:56,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:04:56,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:04:56,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:04:56,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:56,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28581b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56, skipping insertion in model container [2022-11-21 09:04:56,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:56,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:04:56,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:04:56,307 WARN L237 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_8d147939-02fb-4479-93c0-22dc8c9b8a45/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i[949,962] [2022-11-21 09:04:56,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:04:56,727 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:04:56,744 WARN L237 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_8d147939-02fb-4479-93c0-22dc8c9b8a45/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i[949,962] [2022-11-21 09:04:56,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:04:56,893 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:04:56,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56 WrapperNode [2022-11-21 09:04:56,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:04:56,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:04:56,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:04:56,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:04:56,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:56,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:56,976 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-11-21 09:04:56,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:04:56,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:04:56,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:04:56,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:04:56,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:56,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:56,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:56,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:57,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:57,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:57,028 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:57,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:57,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:04:57,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:04:57,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:04:57,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:04:57,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (1/1) ... [2022-11-21 09:04:57,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:04:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:04:57,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:04:57,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:04:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 09:04:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:04:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 09:04:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 09:04:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 09:04:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 09:04:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 09:04:57,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 09:04:57,146 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 09:04:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 09:04:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 09:04:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 09:04:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-21 09:04:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-21 09:04:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 09:04:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:04:57,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:04:57,150 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 09:04:57,367 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:04:57,370 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:04:57,914 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:04:58,149 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:04:58,150 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 09:04:58,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:04:58 BoogieIcfgContainer [2022-11-21 09:04:58,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:04:58,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:04:58,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:04:58,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:04:58,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:04:56" (1/3) ... [2022-11-21 09:04:58,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d7d775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:04:58, skipping insertion in model container [2022-11-21 09:04:58,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:56" (2/3) ... [2022-11-21 09:04:58,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d7d775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:04:58, skipping insertion in model container [2022-11-21 09:04:58,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:04:58" (3/3) ... [2022-11-21 09:04:58,167 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-11-21 09:04:58,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:04:58,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-21 09:04:58,190 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 09:04:58,314 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 09:04:58,381 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 09:04:58,408 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-21 09:04:58,411 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-21 09:04:58,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-21 09:04:58,491 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-21 09:04:58,491 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 09:04:58,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-21 09:04:58,502 INFO L119 LiptonReduction]: Number of co-enabled transitions 3552 [2022-11-21 09:05:11,825 INFO L134 LiptonReduction]: Checked pairs total: 10106 [2022-11-21 09:05:11,825 INFO L136 LiptonReduction]: Total number of compositions: 142 [2022-11-21 09:05:11,835 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-21 09:05:12,182 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 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-21 09:05:12,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:05:12,221 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;@5dc4e1d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:05:12,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-21 09:05:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 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-21 09:05:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 09:05:12,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:12,253 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 09:05:12,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:12,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2022-11-21 09:05:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:12,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012494772] [2022-11-21 09:05:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:05:12,286 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-21 09:05:12,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:12,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:12,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:05:12,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 09:05:12,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:05:12,413 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-21 09:05:12,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:05:12,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:05:12,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012494772] [2022-11-21 09:05:12,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012494772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:05:12,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:05:12,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 09:05:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490180509] [2022-11-21 09:05:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:05:12,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 09:05:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:05:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 09:05:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 09:05:12,491 INFO L87 Difference]: Start difference. First operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 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-21 09:05:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:05:12,991 INFO L93 Difference]: Finished difference Result 4850 states and 19358 transitions. [2022-11-21 09:05:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 09:05:12,995 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-21 09:05:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:05:13,087 INFO L225 Difference]: With dead ends: 4850 [2022-11-21 09:05:13,088 INFO L226 Difference]: Without dead ends: 4850 [2022-11-21 09:05:13,089 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-21 09:05:13,097 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:05:13,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:05:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2022-11-21 09:05:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4850. [2022-11-21 09:05:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4850 states, 4845 states have (on average 3.995459236326109) internal successors, (19358), 4849 states have internal predecessors, (19358), 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-21 09:05:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 19358 transitions. [2022-11-21 09:05:13,752 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 19358 transitions. Word has length 1 [2022-11-21 09:05:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:05:13,753 INFO L495 AbstractCegarLoop]: Abstraction has 4850 states and 19358 transitions. [2022-11-21 09:05:13,753 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-21 09:05:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 19358 transitions. [2022-11-21 09:05:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 09:05:13,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:13,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:13,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 09:05:13,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:13,967 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1419585818, now seen corresponding path program 1 times [2022-11-21 09:05:13,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:13,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657367399] [2022-11-21 09:05:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:05:13,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-21 09:05:13,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:13,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:14,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:05:14,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 09:05:14,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:05:14,187 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-21 09:05:14,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:05:14,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:05:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657367399] [2022-11-21 09:05:14,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657367399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:05:14,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:05:14,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 09:05:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307644763] [2022-11-21 09:05:14,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:05:14,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:05:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:05:14,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:05:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:05:14,193 INFO L87 Difference]: Start difference. First operand 4850 states and 19358 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-21 09:05:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:05:14,489 INFO L93 Difference]: Finished difference Result 3970 states and 15654 transitions. [2022-11-21 09:05:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:05:14,490 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-21 09:05:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:05:14,523 INFO L225 Difference]: With dead ends: 3970 [2022-11-21 09:05:14,523 INFO L226 Difference]: Without dead ends: 3850 [2022-11-21 09:05:14,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 09:05:14,525 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:05:14,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 10 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:05:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2022-11-21 09:05:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3850. [2022-11-21 09:05:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3848 states have (on average 3.9625779625779627) internal successors, (15248), 3849 states have internal predecessors, (15248), 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-21 09:05:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 15248 transitions. [2022-11-21 09:05:14,898 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 15248 transitions. Word has length 7 [2022-11-21 09:05:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:05:14,901 INFO L495 AbstractCegarLoop]: Abstraction has 3850 states and 15248 transitions. [2022-11-21 09:05:14,902 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-21 09:05:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 15248 transitions. [2022-11-21 09:05:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 09:05:14,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:14,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:14,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:15,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:15,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash 121628495, now seen corresponding path program 1 times [2022-11-21 09:05:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:15,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607680584] [2022-11-21 09:05:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:05:15,137 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-21 09:05:15,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:15,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:15,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:05:15,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 09:05:15,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:05:15,453 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-21 09:05:15,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:05:15,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:05:15,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607680584] [2022-11-21 09:05:15,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607680584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:05:15,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:05:15,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:05:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675456704] [2022-11-21 09:05:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:05:15,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:05:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:05:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:05:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:05:15,458 INFO L87 Difference]: Start difference. First operand 3850 states and 15248 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-21 09:05:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:05:15,822 INFO L93 Difference]: Finished difference Result 3250 states and 11398 transitions. [2022-11-21 09:05:15,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:05:15,825 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-21 09:05:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:05:15,846 INFO L225 Difference]: With dead ends: 3250 [2022-11-21 09:05:15,846 INFO L226 Difference]: Without dead ends: 2650 [2022-11-21 09:05:15,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-21 09:05:15,850 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:05:15,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 25 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 09:05:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-11-21 09:05:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2022-11-21 09:05:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2648 states have (on average 3.4924471299093653) internal successors, (9248), 2649 states have internal predecessors, (9248), 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-21 09:05:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 9248 transitions. [2022-11-21 09:05:16,008 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 9248 transitions. Word has length 11 [2022-11-21 09:05:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:05:16,008 INFO L495 AbstractCegarLoop]: Abstraction has 2650 states and 9248 transitions. [2022-11-21 09:05:16,008 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-21 09:05:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 9248 transitions. [2022-11-21 09:05:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 09:05:16,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:16,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:16,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:16,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:16,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:16,243 INFO L85 PathProgramCache]: Analyzing trace with hash 773877537, now seen corresponding path program 1 times [2022-11-21 09:05:16,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:16,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735633403] [2022-11-21 09:05:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:05:16,245 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-21 09:05:16,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:16,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:16,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:05:16,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 09:05:16,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:05:16,502 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-21 09:05:16,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:05:16,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:05:16,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735633403] [2022-11-21 09:05:16,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735633403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:05:16,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:05:16,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 09:05:16,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563189114] [2022-11-21 09:05:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:05:16,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:05:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:05:16,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:05:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:05:16,506 INFO L87 Difference]: Start difference. First operand 2650 states and 9248 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-21 09:05:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:05:16,827 INFO L93 Difference]: Finished difference Result 1770 states and 5486 transitions. [2022-11-21 09:05:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 09:05:16,828 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-21 09:05:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:05:16,838 INFO L225 Difference]: With dead ends: 1770 [2022-11-21 09:05:16,839 INFO L226 Difference]: Without dead ends: 1410 [2022-11-21 09:05:16,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-21 09:05:16,840 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:05:16,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 45 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 09:05:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-11-21 09:05:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2022-11-21 09:05:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1408 states have (on average 3.0454545454545454) internal successors, (4288), 1409 states have internal predecessors, (4288), 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-21 09:05:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 4288 transitions. [2022-11-21 09:05:16,895 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 4288 transitions. Word has length 14 [2022-11-21 09:05:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:05:16,895 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 4288 transitions. [2022-11-21 09:05:16,896 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-21 09:05:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 4288 transitions. [2022-11-21 09:05:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 09:05:16,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:16,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:16,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:17,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:17,115 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:17,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:17,115 INFO L85 PathProgramCache]: Analyzing trace with hash -792573294, now seen corresponding path program 1 times [2022-11-21 09:05:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:17,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23582039] [2022-11-21 09:05:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:05:17,117 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-21 09:05:17,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:17,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:17,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:05:17,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 09:05:17,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:05:17,434 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-21 09:05:17,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:05:17,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:05:17,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23582039] [2022-11-21 09:05:17,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23582039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:05:17,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:05:17,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 09:05:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293160818] [2022-11-21 09:05:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:05:17,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 09:05:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:05:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 09:05:17,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:05:17,438 INFO L87 Difference]: Start difference. First operand 1410 states and 4288 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-21 09:05:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:05:17,858 INFO L93 Difference]: Finished difference Result 1047 states and 3164 transitions. [2022-11-21 09:05:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:05:17,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-11-21 09:05:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:05:17,864 INFO L225 Difference]: With dead ends: 1047 [2022-11-21 09:05:17,865 INFO L226 Difference]: Without dead ends: 935 [2022-11-21 09:05:17,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:05:17,866 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 09:05:17,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 80 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 09:05:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2022-11-21 09:05:17,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2022-11-21 09:05:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 933 states have (on average 3.0685959271168275) internal successors, (2863), 934 states have internal predecessors, (2863), 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-21 09:05:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2863 transitions. [2022-11-21 09:05:17,904 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2863 transitions. Word has length 18 [2022-11-21 09:05:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:05:17,905 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 2863 transitions. [2022-11-21 09:05:17,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-21 09:05:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2863 transitions. [2022-11-21 09:05:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 09:05:17,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:17,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:17,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:18,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:18,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:18,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:18,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1731843369, now seen corresponding path program 1 times [2022-11-21 09:05:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:18,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048092618] [2022-11-21 09:05:18,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:05:18,125 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-21 09:05:18,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:18,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:18,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:05:18,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 09:05:18,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:05:18,418 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-21 09:05:18,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:05:18,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:05:18,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048092618] [2022-11-21 09:05:18,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048092618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:05:18,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:05:18,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:05:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475709506] [2022-11-21 09:05:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:05:18,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:05:18,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:05:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:05:18,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:05:18,423 INFO L87 Difference]: Start difference. First operand 935 states and 2863 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-21 09:05:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:05:18,986 INFO L93 Difference]: Finished difference Result 872 states and 2735 transitions. [2022-11-21 09:05:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 09:05:18,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-11-21 09:05:18,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:05:18,993 INFO L225 Difference]: With dead ends: 872 [2022-11-21 09:05:18,993 INFO L226 Difference]: Without dead ends: 855 [2022-11-21 09:05:18,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 09:05:18,995 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 69 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 09:05:18,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 120 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 09:05:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-11-21 09:05:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-11-21 09:05:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 853 states have (on average 3.168815943728019) internal successors, (2703), 854 states have internal predecessors, (2703), 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-21 09:05:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2703 transitions. [2022-11-21 09:05:19,037 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2703 transitions. Word has length 22 [2022-11-21 09:05:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:05:19,038 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 2703 transitions. [2022-11-21 09:05:19,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-21 09:05:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2703 transitions. [2022-11-21 09:05:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 09:05:19,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:19,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:19,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:19,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:19,259 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1211425915, now seen corresponding path program 1 times [2022-11-21 09:05:19,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:19,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302687141] [2022-11-21 09:05:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:05:19,261 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-21 09:05:19,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:19,262 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:19,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:05:19,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 09:05:19,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:05:19,476 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-21 09:05:19,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:05:19,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:05:19,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302687141] [2022-11-21 09:05:19,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302687141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:05:19,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:05:19,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:05:19,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475614086] [2022-11-21 09:05:19,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:05:19,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:05:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:05:19,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:05:19,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:05:19,480 INFO L87 Difference]: Start difference. First operand 855 states and 2703 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-21 09:05:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:05:19,646 INFO L93 Difference]: Finished difference Result 1195 states and 3679 transitions. [2022-11-21 09:05:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:05:19,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-11-21 09:05:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:05:19,655 INFO L225 Difference]: With dead ends: 1195 [2022-11-21 09:05:19,655 INFO L226 Difference]: Without dead ends: 1195 [2022-11-21 09:05:19,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-21 09:05:19,656 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:05:19,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 13 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:05:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-11-21 09:05:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1193. [2022-11-21 09:05:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1191 states have (on average 3.08816120906801) internal successors, (3678), 1192 states have internal predecessors, (3678), 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-21 09:05:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 3678 transitions. [2022-11-21 09:05:19,715 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 3678 transitions. Word has length 27 [2022-11-21 09:05:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:05:19,715 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 3678 transitions. [2022-11-21 09:05:19,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-21 09:05:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 3678 transitions. [2022-11-21 09:05:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 09:05:19,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:19,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:19,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:19,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:19,937 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:19,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash -62386329, now seen corresponding path program 2 times [2022-11-21 09:05:19,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:19,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357254014] [2022-11-21 09:05:19,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:05:19,944 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-21 09:05:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:19,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:19,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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 (9)] Waiting until timeout for monitored process [2022-11-21 09:05:20,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 09:05:20,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:05:20,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 09:05:20,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:05:20,649 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-21 09:05:20,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:05:20,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:05:20,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357254014] [2022-11-21 09:05:20,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357254014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:05:20,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:05:20,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 09:05:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109474903] [2022-11-21 09:05:20,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:05:20,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 09:05:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:05:20,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 09:05:20,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 09:05:20,653 INFO L87 Difference]: Start difference. First operand 1193 states and 3678 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-21 09:05:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:05:20,974 INFO L93 Difference]: Finished difference Result 1523 states and 4567 transitions. [2022-11-21 09:05:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:05:20,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2022-11-21 09:05:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:05:20,981 INFO L225 Difference]: With dead ends: 1523 [2022-11-21 09:05:20,981 INFO L226 Difference]: Without dead ends: 1523 [2022-11-21 09:05:20,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:05:20,982 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 79 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:05:20,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 43 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 09:05:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-11-21 09:05:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1185. [2022-11-21 09:05:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1183 states have (on average 3.0921386306001692) internal successors, (3658), 1184 states have internal predecessors, (3658), 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-21 09:05:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 3658 transitions. [2022-11-21 09:05:21,024 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 3658 transitions. Word has length 27 [2022-11-21 09:05:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:05:21,024 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 3658 transitions. [2022-11-21 09:05:21,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-21 09:05:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 3658 transitions. [2022-11-21 09:05:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 09:05:21,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:21,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:21,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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 (9)] Forceful destruction successful, exit code 0 [2022-11-21 09:05:21,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:21,248 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:21,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash -634401275, now seen corresponding path program 3 times [2022-11-21 09:05:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:21,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236338531] [2022-11-21 09:05:21,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 09:05:21,250 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-21 09:05:21,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:21,252 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:21,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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 (10)] Waiting until timeout for monitored process [2022-11-21 09:05:21,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 09:05:21,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:05:21,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-21 09:05:21,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:05:21,865 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-21 09:05:21,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:05:21,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 09:05:21,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236338531] [2022-11-21 09:05:21,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236338531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:05:21,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:05:21,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 09:05:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382443600] [2022-11-21 09:05:21,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:05:21,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 09:05:21,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 09:05:21,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 09:05:21,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-21 09:05:21,869 INFO L87 Difference]: Start difference. First operand 1185 states and 3658 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-21 09:05:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:05:22,128 INFO L93 Difference]: Finished difference Result 1479 states and 4445 transitions. [2022-11-21 09:05:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:05:22,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2022-11-21 09:05:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:05:22,136 INFO L225 Difference]: With dead ends: 1479 [2022-11-21 09:05:22,136 INFO L226 Difference]: Without dead ends: 1479 [2022-11-21 09:05:22,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-21 09:05:22,138 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:05:22,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 31 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:05:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2022-11-21 09:05:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1161. [2022-11-21 09:05:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1159 states have (on average 3.09404659188956) internal successors, (3586), 1160 states have internal predecessors, (3586), 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-21 09:05:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 3586 transitions. [2022-11-21 09:05:22,195 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 3586 transitions. Word has length 27 [2022-11-21 09:05:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:05:22,196 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 3586 transitions. [2022-11-21 09:05:22,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-21 09:05:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 3586 transitions. [2022-11-21 09:05:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 09:05:22,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:05:22,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:22,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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 (10)] Forceful destruction successful, exit code 0 [2022-11-21 09:05:22,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:22,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-21 09:05:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:05:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash 702752849, now seen corresponding path program 4 times [2022-11-21 09:05:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 09:05:22,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799192208] [2022-11-21 09:05:22,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 09:05:22,417 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-21 09:05:22,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 09:05:22,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:22,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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 (11)] Waiting until timeout for monitored process [2022-11-21 09:05:22,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 09:05:22,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 09:05:22,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 09:05:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 09:05:22,828 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 09:05:22,828 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 09:05:22,829 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-21 09:05:22,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-21 09:05:22,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-21 09:05:22,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-21 09:05:22,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-21 09:05:22,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-21 09:05:22,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-21 09:05:22,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-21 09:05:22,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-21 09:05:22,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-21 09:05:22,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-21 09:05:22,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-21 09:05:22,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-21 09:05:22,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-21 09:05:22,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-21 09:05:22,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-21 09:05:22,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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 (11)] Forceful destruction successful, exit code 0 [2022-11-21 09:05:23,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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-21 09:05:23,050 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-11-21 09:05:23,056 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 09:05:23,056 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 09:05:23,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:05:23 BasicIcfg [2022-11-21 09:05:23,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 09:05:23,156 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 09:05:23,156 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 09:05:23,156 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 09:05:23,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:04:58" (3/4) ... [2022-11-21 09:05:23,160 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 09:05:23,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 09:05:23,161 INFO L158 Benchmark]: Toolchain (without parser) took 27144.55ms. Allocated memory was 69.2MB in the beginning and 436.2MB in the end (delta: 367.0MB). Free memory was 39.6MB in the beginning and 135.8MB in the end (delta: -96.2MB). Peak memory consumption was 271.3MB. Max. memory is 16.1GB. [2022-11-21 09:05:23,162 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 69.2MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:05:23,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 875.76ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 39.4MB in the beginning and 50.6MB in the end (delta: -11.2MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-11-21 09:05:23,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.92ms. Allocated memory is still 83.9MB. Free memory was 50.6MB in the beginning and 47.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 09:05:23,163 INFO L158 Benchmark]: Boogie Preprocessor took 65.65ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 45.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 09:05:23,164 INFO L158 Benchmark]: RCFGBuilder took 1110.78ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 47.6MB in the end (delta: -2.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2022-11-21 09:05:23,164 INFO L158 Benchmark]: TraceAbstraction took 24998.87ms. Allocated memory was 83.9MB in the beginning and 436.2MB in the end (delta: 352.3MB). Free memory was 47.2MB in the beginning and 135.8MB in the end (delta: -88.6MB). Peak memory consumption was 263.5MB. Max. memory is 16.1GB. [2022-11-21 09:05:23,165 INFO L158 Benchmark]: Witness Printer took 5.24ms. Allocated memory is still 436.2MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 09:05:23,167 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.35ms. Allocated memory is still 69.2MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 875.76ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 39.4MB in the beginning and 50.6MB in the end (delta: -11.2MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.92ms. Allocated memory is still 83.9MB. Free memory was 50.6MB in the beginning and 47.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.65ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 45.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1110.78ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 47.6MB in the end (delta: -2.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24998.87ms. Allocated memory was 83.9MB in the beginning and 436.2MB in the end (delta: 352.3MB). Free memory was 47.2MB in the beginning and 135.8MB in the end (delta: -88.6MB). Peak memory consumption was 263.5MB. Max. memory is 16.1GB. * Witness Printer took 5.24ms. Allocated memory is still 436.2MB. Free memory is still 135.8MB. 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: 13.4s, 160 PlacesBefore, 56 PlacesAfterwards, 149 TransitionsBefore, 44 TransitionsAfterwards, 3552 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 10106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5432, independent: 5203, independent conditional: 0, independent unconditional: 5203, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2683, independent: 2594, independent conditional: 0, independent unconditional: 2594, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2683, independent: 2543, independent conditional: 0, independent unconditional: 2543, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 140, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 911, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 777, dependent conditional: 0, dependent unconditional: 777, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5432, independent: 2609, independent conditional: 0, independent unconditional: 2609, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 2683, unknown conditional: 0, unknown unconditional: 2683] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 358, Positive conditional cache size: 0, Positive unconditional cache size: 358, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=-1, t577={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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=0, t577={3:0}, t578={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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=1, t577={3:0}, t578={7:0}, t579={11: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L852] 0 pthread_t t580; [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=2, t577={3:0}, t578={7:0}, t579={11:0}, t580={15: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={3:0}, t578={7:0}, t579={11:0}, t580={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 847]: 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: 851]: 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 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 24.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 372 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1387 IncrementalHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 113 mSDtfsCounter, 1387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5140occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 658 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 1047 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1334 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-21 09:05:23,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d147939-02fb-4479-93c0-22dc8c9b8a45/bin/uautomizer-vX5HgA9Q3a/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